Can anyone tell me why this search parition for quicksort works?
sortFirstMiddleLast() sorts the first, middle, and last elements in-place. Once that's done, there's no need to consider the first or last value because (if the middle value is used as the pivot) they're known to be correctly partitioned.