struct Item {
    int data;
    struct Item *next;
};



Item *sortList(Item *head) {

    Item *current = head;
    int size = 0;

    while (current != NULL) {
        size++;
        current = current->next;
    }

    int *temp = new int[size];
    int j = 0;

    current = head;

    while (current != NULL) {
        temp[j++] = current->data;
        current = current->next;
    }

    sortArr(temp, size);
    freeList(head);
    head = NULL;

    for (int i = size - 1; i >= 0; i--) {
        head = add(head, temp[i]);
    }

    delete[] temp;
    return head;
}


Item *sortList2(Item *head) {

    Item *current = head;


    while (current != NULL) {



    }


    return head;
}


int main() {

    Item *head1 = NULL;
    Item *head2 = NULL;

    head1 = add(head1, 15);
    head1 = add(head1, 11);
    head1 = add(head1, 9);
    head1 = add(head1, 6);
    head1 = add(head1, 5);
    head1 = add(head1, 2);
    head1 = add(head1, 1);

    head2 = add(head2, 15);
    head2 = add(head2, 6);
    head2 = add(head2, 5);
    head2 = add(head2, 4);
    head2 = add(head2, 2);

    Item *res = sortList(head1);
    printList(res);


    return 0;
}