Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm

Details Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm

2012-04-23

arxiv.org/abs/1204.5083v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444485