Why do we use quicksort instead of heapsort?

We were given code for quicksort as part of a larger project and are supposed to modify it to have a random pivot value instead of using the last element, as given in the initial implementation. However, my attempt at randomizing the pivot isn't working...

We were given code for quicksort as part of a larger project and are supposed to modify it to have a random pivot value instead of using the last element, as given in the initial implementation. However, my attempt at randomizing the pivot isn't working...

Why is heap sort not accepted much even though it runs in O(nlogn) in worst case with O(1) constant space?

//I want to use it for a quick sort but it won't work, what exactly must //partition accept and return? void quicksort( int x[], int n ) { if(n <= 1) return; int m=partition(x, n); quicksort()(x, m); quicksort()(x + m + 1, n - m - 1); }

Use HeapSort to sort out the following numbers in descending order, 18, 25, 19, 32

Use HeapSort to sort out the following numbers in descending order, 18, 25, 19, 32