карманная сортировка

#include <stdio.h>
 
#include <stdlib.h>
 
#include "stdbool.h"
#include "assert.h"
 
typedef struct item Item;
typedef struct list List;
 
struct item {
Elem *value;
Item *next;
};
 
struct list {
Item *head;
};
 
List *CreateList(){
 
List *list = (List*) malloc (sizeof(List));
if (list == NULL)
return 0;
 
list->head = NULL;
return list;
 
}
 
Item *first (List *list){
 
assert (list != NULL);
 
return list->head;
 
}
 
Item *next (List *list){
 
assert (list != NULL);
list = list->head->next;
 
return list;
 
}
 
bool isDone (List *list){
 
return list->head == NULL;
 
}
 
void Past(List *list, Elem *new_value){
Item **x = &list->head;
 
while((*x != NULL) && ((*x)->value->key <= new_value->key))
x = &((*x)->next);
 
Item *t = (Item*) malloc (sizeof(Item));
t->value = new_value;
t->next = *x;
*x = t;
}
 
void Delete(List **list){
Item *y = (*list)->head;
(*list)->head = NULL;
Item *p;
while(y != NULL){
p = y;
y = y->next;
free(p);
}
free(*list);
*list = NULL;
 
}
 
int Print(List* list) {
Item *i;
 
for (i = list->head; i != NULL; i = i->next){
printf("%Lu\t%s\n", i->value->key, i->value->data);
}
return 0;
}