An Empirical Evaluation of a New Comparison Sort Algorithm
Abstract
Full Text:
PDFReferences
D. A. Bell. Principles of sorting, Comput J. 1958; 1
(2): 71–7p. [2] A. Aho, et al. The Designand Analysis of Computer Algorithms. Addison Wesley; 1974.
J. Alnihoud, et al. An enhancement of major sorting algorithms, Int Arab J Inform Technol. 2010; 7(1): 55– 62p.
O. Astrachan. Bubble sort: an archaeological algorithmic analysis, In: Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education. Reno, Nevada, USA, ACM, 2003, 1–5p.
E. Friend. Sorting on electronic computer systems, Comput J ACM. 1956; 3(2), 134–68p.
P. S. Deshpande, et al. C & Data Structures. Hingham, MA: Charles River Media, Inc.; 2006.
E. Machkasova. An insightful empirical comparison of sorting algorithms, Midwest Instruct Comput Symp. 2011; 1–11p.
R. Islam, et al. An external sorting algorithm using in-place merging and with no additional disk space, Malaysian J Comput Sci. 2005; 18(1): 40–9p.
Y. Wang. A new sort algorithm: self-indexed sort, Commun ACM SIGPALN. 1996; 31(3): 28–36p.
DOI: https://doi.org/10.37628/ijosct.v3i1.205
Refbacks
- There are currently no refbacks.