Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!

Details Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more! Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!

2012-03-08

arxiv.org/abs/1203.1830v2

International Journal of Computer Science, Engineering and Applications,Vol.2, No.1, Feb 2012, p 23-30

Computer Science

Data Structures and Algorithms

8 pages

Scientific paper

10.5121/ijcsea.2012.2103

In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick Sort. In our first study in this paper, we reconfirm this through computer experiments for inputs from Cauchy distribution for which expectation theoretically does not exist. Additionally, the algorithm is found to be sensitive to parameters of the input probability distribution demanding further investigation on parameterized complexity. The results on this algorithm for Binomial inputs in our second study are very encouraging in that direction.

Affiliated with

Also associated with

No associations

Rating

Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more! 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 Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more! will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-17552