Stable Sorting and Merging with Optimal Space and Time Bounds
- 1 June 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (2) , 351-372
- https://doi.org/10.1137/0206025
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- A fast stable sorting algorithm with absolutely minimum storageTheoretical Computer Science, 1975
- A stable minimum storage sorting algorithmInformation Processing Letters, 1974