2.1.1.1 Median-of-Three Rule Unlike quicksort that picks the first element as the pivot value, the Median-of-Three version selects the median of the first, middle and the last elements in each sub-list. This approach increases the performance of quicksort when the list of elements to be sorted is already or partially sorted [1, 6].