Final Challenge #2
Lesson 9 of 9 in Coddy's Radix Sort - DSA Series course.
Challenge
MediumOne more challenge.
Write radixSort so it returns the array sorted in ascending order with duplicates removed, so every value appears exactly once.
For example, [3, 1, 2, 3, 1] becomes [1, 2, 3].
Try it yourself
#include <stdlib.h>
int* radixSort(int* arr, int arr_size, int* returnSize) {
// Write code here
*returnSize = arr_size;
return arr;
}
