sort_array

Sorting and searching24

Objective

Implement a function that rearranges the elements of an integer array in non-decreasing order, modifying the buffer directly without returning anything.

Steps

The function takes a pointer to the first element and the number of values stored after it.
Reorder the values in place so that smaller integers come before larger ones.
When the size is zero, leave the buffer untouched and return immediately.
Equal values must remain in the output; do not deduplicate.

examples

$ int t[] = {4, 1, 3, 2}; sort_array(t, 4);

{1, 2, 3, 4}

$ int t[] = {-2, 5, -7, 0, 3}; sort_array(t, 5);

{-7, -2, 0, 3, 5}

Constraints

Expected files

sort_array.c

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build

01Empty array stays empty

02Single element unchanged

03Already sorted input

04Reverse sorted input

05Duplicates preserved

06Negatives and positives

07Includes INT_MIN and INT_MAX

08All values identical

sort_array

Objective

Implement a function that rearranges the elements of an integer array in non-decreasing order, modifying the buffer directly without returning anything.

Steps

The function takes a pointer to the first element and the number of values stored after it.
Reorder the values in place so that smaller integers come before larger ones.
When the size is zero, leave the buffer untouched and return immediately.
Equal values must remain in the output; do not deduplicate.

examples

$ int t[] = {4, 1, 3, 2}; sort_array(t, 4);

{1, 2, 3, 4}

$ int t[] = {-2, 5, -7, 0, 3}; sort_array(t, 5);

{-7, -2, 0, 3, 5}

Constraints

Expected files

sort_array.c

Allowed functions

None. Write every helper yourself.

sort_array

Sorting and searching24

Objective

Implement a function that rearranges the elements of an integer array in non-decreasing order, modifying the buffer directly without returning anything.

Steps

The function takes a pointer to the first element and the number of values stored after it.
Reorder the values in place so that smaller integers come before larger ones.
When the size is zero, leave the buffer untouched and return immediately.
Equal values must remain in the output; do not deduplicate.

examples

$ int t[] = {4, 1, 3, 2}; sort_array(t, 4);

{1, 2, 3, 4}

$ int t[] = {-2, 5, -7, 0, 3}; sort_array(t, 5);

{-7, -2, 0, 3, 5}

Constraints

Expected files

sort_array.c

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build

01Empty array stays empty

02Single element unchanged

03Already sorted input

04Reverse sorted input

05Duplicates preserved

06Negatives and positives

07Includes INT_MIN and INT_MAX

08All values identical