Abstract
This paper provides a new sorting algorithm called “Only-Once-Sorting” algorithm. Using a mathematical formula, this algorithm can put elements in the positions they should be stored only once, then compacts them. The algorithm completes sorting a sequence ofn elements in a calculation time of O(n).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho A V. The design and analysis of computer algorithm. Boston: Addision-wesley publishing company, 1975
Xu Xusong. Data structure and algorithm. Wuhan: Wuhan university press, 1987
Editing and writing group of Fudan University. On probabilistic. Beijing: High education press, 1981
Author information
Authors and Affiliations
Additional information
Xu Xusong: born in June 1945. Professor. Current research interest is in data structure and algorithm, information systems analysis and design
Rights and permissions
About this article
Cite this article
Xusong, X., Jianqin, Z. & Feng, G. An only-once-sorting algorithm. Wuhan Univ. J. of Nat. Sci. 1, 38–41 (1996). https://doi.org/10.1007/BF02827576
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02827576