Below is the pseudocode for Quicksort and Partition that we
talked about in class. As usual with recursive functions on arrays,
we see the array indices s and e as arguments. Quicksort(A, s, e)
sorts the part of the array between s and e inclusively. The
initial call (that is, to sort the entire array) is Quicksort(A, 0,
n − 1)
QuickSort(A, s, e)
if s < e
p = Partition (A, s, e) // Partition
the array and return...