v0.40: Create exercises. Challenge the community.

sort_list

Your mission

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

See it in action

sort_list([91 -> 34 -> 57], ascending)

Expected result

[34 -> 57 -> 91]

Your checklist

For your own tracking. Tests grade your code.

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));.

More examples

ascending(a, b)

Expected result

returns non-zero when `a <= b`

Constraints

Expected files

sort_list.c

Allowed functions

None. Write every helper yourself.

sort_list

Generic code

Your mission

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

See it in action

sort_list([91 -> 34 -> 57], ascending)

Expected result

[34 -> 57 -> 91]

Your checklist

For your own tracking. Tests grade your code.

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));.

More examples

ascending(a, b)

Expected result

returns non-zero when `a <= b`

Constraints

Expected files

sort_list.c

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01Original list orderWaiting

02Sorted list orderWaiting

sort_list

Your mission

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

See it in action

sort_list([91 -> 34 -> 57], ascending)

Expected result

[34 -> 57 -> 91]

Your checklist

For your own tracking. Tests grade your code.

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));.

More examples

ascending(a, b)

Expected result

returns non-zero when `a <= b`

Constraints

Expected files

sort_list.c

Allowed functions

None. Write every helper yourself.

v0.40: Create exercises. Challenge the community.

Meet Studio →

sort_list

Generic code

Your mission

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

See it in action

sort_list([91 -> 34 -> 57], ascending)

Expected result

[34 -> 57 -> 91]

Your checklist

For your own tracking. Tests grade your code.

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));.

More examples

ascending(a, b)

Expected result

returns non-zero when `a <= b`

Constraints

Expected files

sort_list.c

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01Original list orderWaiting

02Sorted list orderWaiting