Exploiting partial order with Quicksort
- 1 June 1984
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 14 (6) , 509-518
- https://doi.org/10.1002/spe.4380140603
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Smoothsort, an alternative for sorting in situScience of Computer Programming, 1982
- Sorting unsorted and partially sorted lists using the natural merge sortSoftware: Practice and Experience, 1981
- Best sorting algorithm for nearly sorted listsCommunications of the ACM, 1980
- Implementing Quicksort programsCommunications of the ACM, 1978
- Increasing the efficiency of quicksortCommunications of the ACM, 1970
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- Algorithm 271: quickersortCommunications of the ACM, 1965
- QuicksortThe Computer Journal, 1962