A note on some distributions that are sorted faster than others by our new sorting algorithm

by Suman Kumar Sourabh, Kiran Kumar Sundararajan and Soubhik Chakraborty .

Abstract: The present paper compares the average complexity (Sorting Time) for different distribution inputs using our new sorting algorithm [K. K. Sundararajan, S. Chakraborty, A new sorting algorithm, Jour. of Applied Math.And Compu. (2006) in press; doi: 10.1016/j.amc.2006.10.065]. We next propose to implement this algorithm by using random pivots and remove the auxiliary array.

Key Words: New Sorting Algorithm, average complexity, comparisons, distribution inputs, random pivots, auxiliary array

Authors:
Suman Kumar Sourabh, sourabh.suman@rediffmail.com
Kiran Kumar Sundararajan, kirankumars@hexaware.com
Soubhik Chakraborty, soubhikc@yahoo.co.in

Editor: Richard G. Graf, rgraf@sunstroke.sdsu.edu

READING THE ARTICLE: You can read the article in portable document (.pdf) format (42392 bytes.)

NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.

This page has been accessed 295 times since March 9, 2007.

Return to the InterStat Home Page.