A fast stable sorting algorithm with absolutely minimum storage

An algorithm is described which sorts n numbers in place with the property of stability, i. e. , preserving the original order of equal elements. The algorithm requires absolutely minimum storage 0 (log2 n) bits for program variables and a computation time at most 0 (n (log2 n)2).

Authors

• F.P. Preparata

Keywords

No keywords are indexed for this paper.