1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
hashtable(I);

   printf("\n\nThis is a seperator\n\n");

   printOverflow();



void printOverflow()
{
   int count = 1;

   for(node *current = ListStart; current != NULL; current = current->next)
   {
      printf("%7d", current->key);

      if(count%10==0) printf("\n");

      count++;
   }
}