コード例 #1
0
ファイル: main.c プロジェクト: omouse/algorithms-practice
void test_single_linked_list() {
  LinkedList *list = createLinkedList();
  printf("Starting size of the list: %d\n", sizeOfList(list));
  insertNumber(5, list);
  printf("Inserting number into list, new size: %d\n", sizeOfList(list));
  removeAll(list);
  free(list);
}
コード例 #2
0
void sortNodes( Node* in, Node** out, Node** oldCopy )
{
    // Sort by frequency.
    //Converts the list into array.
    int len = sizeOfList( in );
    Node* arr = convertListToArray( in, len);
    *oldCopy = arr;
    qsort( arr, len, sizeof(Node), Comparator );
	relink( arr, len );
    *out = arr;

}