Final Challenge #1
Lesson 8 of 9 in Coddy's Quick Sort - DSA Series course.
Challenge
EasyTime to put a twist on Quick Sort.
Modify your quickSort function so it sorts the array in descending order (from largest to smallest) and returns it.
Hint: the only real change is which group you build first when you partition around the pivot.
Try it yourself
#include <stdlib.h>
int* quickSort(int* arr, int arr_size, int* returnSize) {
// Write code here
*returnSize = arr_size;
return arr;
}
