An only-once-sorting algorithm
Wuhan University Journal of Natural Sciences1996Vol. 1(1), pp. 38–41
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).
Related Papers
- → Analysis and Research of Sorting Algorithm in Data Structure Based on C Language(2020)6 cited
- A B—Quick Sorting Algorithm(2002)
- Selective Sorting Algorithm from Both Ends in Arrays(2012)
- → TOOLS FOR COMPARING THE RESULTS OF THE WORK OF SORTING ALGORITHMS(2018)
- → Designing Hybrid Sorting Algorithm for PC with GPU(2011)