|
|||||
|
|
A fast stable sorting algorithm with absolutely minimum storage |
|
| Authors: | F. P. Preparata |
| Affiliation: | Istituto di Scienze dell''Informazione, Università di Pisa, Pisa, Italy |
| 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). |
| Keywords: | Present address: Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana Illinois 61801 U.S.A. |
| 本文献已被 ScienceDirect 等数据库收录！ | |