//
// qst: Do a quicksort. First, find the median element, and put that one in the
// first place as the discriminator. (This "median" is just the median of the
//
// qst: Do a quicksort. First, find the median element, and put that one in the
// first place as the discriminator. (This "median" is just the median of the