Mohamed Akram mohd-akram

## schotter.c
/*
 * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *   * Redistributions of source code must retain the above copyright notice,
 *     this list of conditions and the following disclaimer.
 *   * Redistributions in binary form must reproduce the above copyright

## matrix.c
#include <stdlib.h>
#include <time.h>

#include <windows.h>

#define WIDTH  80
#define HEIGHT 40

#define idx(x, y) ((x)+WIDTH*(y))

## query_sort.py
"""This module sorts a list of results based on a query.

If there is an intersection between words in the query and a result, it
is placed near the beginning of the list (based on length of intersection).

If there is no intersection, the position of the query (substring) in the
result (string) is used for sorting. These results are placed toward the end
of the list.
"""

## minesweeper.py
"""A command line version of Minesweeper"""
import random
import re
import time
from string import ascii_lowercase


def setupgrid(gridsize, start, numberofmines):
    emptygrid = [['0' for i in range(gridsize)] for i in range(gridsize)]