int CountNodes(struct List *list) {
    struct Node *node;
    int count = 0;
 
    for (node = list->lh_Head; node->ln_Succ != NULL; node = node->ln_Succ)
        count++;
 
    return count;
}
 
void SortList(struct List *list, struct Hook *cmphook) {
    int i, j, count;
    struct Node *curr, *next;
 
    count = CountNodes(list);
 
    if (count <= 1)
        return;
 
    for (i = 0; i < count; i++) {
        curr = IExec->GetHead(list);
        for (j = 0; j < count - 1 - i; j++) {
            next = IExec->GetSucc(curr);
            if ((int)IUtility->CallHookPkt(cmphook, curr, next) > 0) {
                IExec->Remove(curr);
                IExec->Insert(list, curr, next);
            } else {
                curr = next;
            }
        }
    }
}

void sort_list (struct List *list, int (*compar)(const void*, const void*))
{
struct Node **array;
struct Node *node,*next;
long n,i;
 
n = 0;
for (node = list->lh_Head; (next = node->ln_Succ); node = next)
	n ++;
 
if ((array = malloc (n * sizeof(*array))))
	{
	for (i = 0; i < n; i++)
		array[i] = RemHead (list);
 
	qsort (array, n, sizeof(*array), compar);
 
	for (i = 0; i < n; i++)
		AddTail (list, array[i]);
 
	free (array);
	}
}
 
 
int compare_nodes (const struct Node **n1, const struct Node **n2)
{
return (Stricmp ((*n1)->ln_Name, (*n2)->ln_Name);
}