Survey on Algorithms 347, 426, and Quicksort
- 1 September 1976
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 2 (3) , 290-299
- https://doi.org/10.1145/355694.355702
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Expected time bounds for selectionCommunications of the ACM, 1975
- Some performance tests of “quicksort” and descendantsCommunications of the ACM, 1974
- Samplesort: A Sampling Approach to Minimal Storage Tree SortingJournal of the ACM, 1970
- A processor allocation method for time-sharingCommunications of the ACM, 1970
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained ProblemsThe Computer Journal, 1966
- Algorithm 63: partitionCommunications of the ACM, 1961
- An Automatic Method for Finding the Greatest or Least Value of a FunctionThe Computer Journal, 1960