Smart sort: Design and analysis of a fast, Efficient and robust comparison based internal sort algorithm
NK Singh, S Chakraborty - arXiv preprint arXiv:1204.5083, 2012 - arxiv.org
NK Singh, S Chakraborty
arXiv preprint arXiv:1204.5083, 2012•arxiv.orgSmart Sort algorithm is a" smart" fusion of heap construction procedures (of Heap sort
algorithm) into the conventional" Partition" function (of Quick sort algorithm) resulting in a
robust version of Quick sort algorithm. We have also performed empirical analysis of
average case behavior of our proposed algorithm along with the necessary theoretical
analysis for best and worst cases. Its performance was checked against some standard
probability distributions, both uniform and non-uniform, like Binomial, Poisson, Discrete & …
algorithm) into the conventional" Partition" function (of Quick sort algorithm) resulting in a
robust version of Quick sort algorithm. We have also performed empirical analysis of
average case behavior of our proposed algorithm along with the necessary theoretical
analysis for best and worst cases. Its performance was checked against some standard
probability distributions, both uniform and non-uniform, like Binomial, Poisson, Discrete & …
Smart Sort algorithm is a "smart" fusion of heap construction procedures (of Heap sort algorithm) into the conventional "Partition" function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases. Its performance was checked against some standard probability distributions, both uniform and non-uniform, like Binomial, Poisson, Discrete & Continuous Uniform, Exponential, and Standard Normal. The analysis exhibited the desired robustness coupled with excellent performance of our algorithm. Although this paper assumes the static partition ratios, its dynamic version is expected to yield still better results.
arxiv.org