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

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.