Elsevier

Theoretical Computer Science

Volume 1, Issue 2, December 1975, Pages 185-190
Theoretical Computer Science

A fast stable sorting algorithm with absolutely minimum storage

https://doi.org/10.1016/0304-3975(75)90019-5Get rights and content
Under an Elsevier user license
open archive

Abstract

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 (log2n) bits for program variables and a computation time at most 0 (n (log2n)2).

Cited by (0)

This work was supported in part by Grant N. 72.00254.42 of the National Research Council of Italy and in part by I.R.I.A., Le Chesnay, France.