K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!

Details K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs! K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!

2011-07-19

arxiv.org/abs/1107.3622v1

Computer Science

Data Structures and Algorithms

9 pages, 9 figures

Scientific paper

Sundararajan and Chakraborty (2007) introduced a new version of Quick sort removing the interchanges. Khreisat (2007) found this algorithm to be competing well with some other versions of Quick sort. However, it uses an auxiliary array thereby increasing the space complexity. Here, we provide a second version of our new sort where we have removed the auxiliary array. This second improved version of the algorithm, which we call K-sort, is found to sort elements faster than Heap sort for an appreciably large array size (n <= 70,00,000) for uniform U[0, 1] inputs.

Affiliated with

Also associated with

No associations

Rating

K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs! 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 K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs! will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-513882