论文信息 - A new Relative sort algorithm based on arithmetic mean value

A new Relative sort algorithm based on arithmetic mean value

In this article we propose a novel sorting algorithm based on comparing the arithmetic mean with each item in the list. Running cost analysis and results obtained after various implementations are also provided with the intention of comparing the efficiency of the proposed mechanism with other existing sorting methodologies.

M.Y. Javed | W.H. Butt | M.Y. Javed | W.H. Butt

[1] Robert Sedgewick,et al. Techniques for Algorithm Animation , 1985, IEEE Software.

[2] Robert Sedgewick,et al. Algorithms in C , 1990 .

[3] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[4] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .

[5] Donald L. Shell,et al. A high-speed sorting procedure , 1959, CACM.

[6] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[7] Tony Hoare,et al. Algorithm 63‚ Partition; Algorithm 64‚ Quicksort; Algorithm 65‚ Find , 1961 .