Final Challenge #1
Lesson 8 of 9 in Coddy's Radix Sort - DSA Series course.
Challenge
EasyTime to put a twist on Radix Sort.
Modify your radixSort function so it returns the array in descending order (from largest to smallest).
Radix Sort naturally produces ascending order, so the simplest approach is to sort ascending and then reverse the result.
Try it yourself
#include <stdlib.h>
int* radixSort(int* arr, int arr_size, int* returnSize) {
// Write code here
*returnSize = arr_size;
return arr;
}
