Implementing Hash Table with Linear Probing in C

Using C, Implement a hash table that uses linear probing for collision resolution. The probing function is form h(i') = (h(i)-k) mod n.

Input: The first line of input shall be a tuple n,k while the next lines will be the keys that will be inserted to the hash table (the hash function will be key mod n) Maximum size of the table is 1000

Output: The output will be the elements of the hash table in the order as they are inside the hash table. If a particular cell in the hash table is empty, then print e.

Sample I/O 1:

Sample I/O 2:

Sample Input 1 143 19 23 492 33 47 61 39 49 50 322 38 49 Sample Output 1 322 38 492 e 49 19 e 61 50 23 47 39 49 33 Sample Input 2 101 27 28 29 30 31 32 33 34 35 36 Sample Output 2 30 31 32 33 34 35 36 27 28 29