Sort 3, 5, 1, 2, 5, 9, 2, 7, 4, 3, 4 using Quicksort with median-of-three partitioning.

Assume that the three candidate elements are not pre-sorted when selecting the pivot, but that the pivot is moved to the end in each step. Assume a cutoff of 3, i.e. once a partition size reaches 3, the elements are sorted by explicit comparison.