For quicksort, one needs a partition function. Let's say we wanted to sort a list into descending order.
Write pseudo-code for a partition function that can be used with such a sort.
How much work does this partition function do for n elements? You do not need to write the pseudo-code for this quicksort.