A statistical approach to the relative performance analysis of sorting algorithms
Niraj Kumar Singh, Soubhik Chakraborty · 2012
In this paper, we have performed a relative statistical analysis of quick, heap and smart sorts. The experimental results suggest, in average case, smart sort as the best alternative as it was found to be more robust and efficient especially if ties are present. If ties are absent, e.g. for continuous inputs, quick sort performs somewhat better than the other two.