Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 177)

Abstract

In our previous work we introduced Partition sort and found it to be more robust compared to the Quick sort in average case. This paper does a more comprehensive comparative study of the relative performance of these two algorithms with focus on parameterized complexity analysis. The empirical results revealed that Partition sort is the better choice for discrete distribution inputs, whereas Quick sort was found to have a clear edge for continuous data sets.

Keywords

Partition Sort Quick sort average case parameterized complexity robustness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chakraborty, S., Sourabh, S.K.: A Computer Experiment Oriented Approach to Algorithmic Complexity. Lambert Academic Publishing (2010)Google Scholar
  2. 2.
    Chakraborty, S., Modi, D.N., Panigrahi, S.: Will the Weight-based Statistical Bounds Revolutionize the IT? International Journal of Computational Cognition 7(3), 16–22 (2009)Google Scholar
  3. 3.
    Chakraborty, S., Sourabh, S.K., Bose, M., Sushant, K.: Replacement sort revisited: The “gold standard” unearthed! Applied Mathematics and Computation 189(2), 384–394 (2007)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)Google Scholar
  5. 5.
    Fang, K.T., Li, R., Sudjianto, A.: Design and Modeling of Computer Experiments. Chapman and Hall (2006)Google Scholar
  6. 6.
    Mahmoud, H.: Sorting: A Distribution Theory. John Wiley and Sons (2000)Google Scholar
  7. 7.
    Sacks, J., Weltch, W., Mitchel, T., Wynn, H.: Design and Analysis of Computer Experiments. Statistical Science 4(4) (1989)Google Scholar
  8. 8.
    Singh, N.K., Chakraborty, S.: Partition Sort and Its Empirical Analysis. In: Das, V.V. (ed.) CIIT 2011. CCIS, vol. 250, pp. 340–346. Springer, Heidelberg (2011)Google Scholar
  9. 9.
    Sourabh, S.K., Chakraborty, S.: How robust is quicksort average complexity? arXiv:0811.4376v1 (cs.DS)Google Scholar
  10. 10.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Computer Science & EngineeringB.I.T. MesraRanchiIndia
  2. 2.Department of Applied MathematicsB.I.T. MesraRanchiIndia

Personalised recommendations