We can make the quick-select algorithm deterministic, by choosing the pivot of an n-element sequence as follows:Partition the set S into n/r groups of size r each (except possibly for one group). Sort each little set and identify the median element in this set. From this set of n/r baby medians, apply the selection algorithm recursively to find the median of the baby medians. Use this element as the pivot and proceed as in the quick-select algorithm.

Implement the above in Python programming language for various values of r, 3 <= r <= and compare timings with simply merge-sorting and picking the k-th smallest element algorithm