Objective

Implement a function that reorders the nodes of a linked list according to a comparator you receive as a parameter.

Steps

• Include list.h in your sort_list.c file; it defines the ListNode type.
• The comparator receives two integer values and returns a non-zero result when they are already in the correct relative order.
• Do not discard duplicate values, every node present in the input must appear in the output.
• Return a pointer to the head node of the newly ordered list.
• The prototype is ListNode *sort_list(ListNode *lst, int (*cmp)(int, int));.

Objective

Implement a function that reorders the nodes of a linked list according to a comparator you receive as a parameter.

Steps

• Include list.h in your sort_list.c file; it defines the ListNode type.
• The comparator receives two integer values and returns a non-zero result when they are already in the correct relative order.
• Do not discard duplicate values, every node present in the input must appear in the output.
• Return a pointer to the head node of the newly ordered list.
• The prototype is ListNode *sort_list(ListNode *lst, int (*cmp)(int, int));.