- 1 ASHENHURST, R.L. Sorting and arranging. Theory of switching, Rep. No. BL/7. Harvard Comput. Lab., Sect. 1, 1953.Google Scholar
- 2 IVERSON, K. E. A Programming Language. Wiley, New York, 1962. Google ScholarDigital Library
- 3 NAGLER, H. Amphisbaenic sorting. J. ACM 6 (Oct. 1959), 459-468. Google ScholarDigital Library
- 4 PL/I : Language specifications. IBM Form No. C28-6571.Google Scholar
- 5 Sorting techniques. IBM Form No. C20-1639.Google Scholar
Recommendations
Proportion split sort
This paper introduces a new sorting algorithm called PROPORTION SPLIT SORT. The algorithm splits a sequence into two blocks in the ratio of 1 : p - 1, where p is a fixed constant, then divides them into four blocks with the median of the first block ...
Proportion Extend Sort
PROPORTION EXTEND SORT is a new sorting algorithm, the basic principle of which is similar to PROPORTION SPLIT SORT. This algorithm sorts a sequence by constructing three subproblems, using a QuickSort-like pivot technique and solving recursively each ...
A new sort algorithm: self-indexed sort
This paper presents a new sort algorithm, self-indexed sort (SIS), on an approach of non compare-based sorting. Results on time complexity O(n) and space complexity O(n+m) are achieved, where n is the size of data being sorted and m is the size of the ...
Comments