Partial quicksort

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2004, Pages 224-228

  Martínez, Conrado ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; NUMERICAL METHODS; PROBLEM SOLVING;

LINEAR APPROXIMATIONS; PARTIAL QUICKSORT;

QUADRATIC PROGRAMMING;

EID: 8344222931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. J.L. Bentley and M.D. McIlroy. Engineering a sort function. Software - Practice and Experience, 23:1249-1265, 1993.
2. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 360-369, 1997.
3. C.A.R. Hoare. FIND (Algorithm 65). Comm. ACM, 4:321-322, 1961.
4. C.A.R. Hoare. Quicksort. Computer Journal, 5:10-15, 1962.
5. N.M. Josuttis. The C++ Standard Library: A Tutorial and Reference Guide. Addison-Wesley, 1999.
6. P. Kirschenhofer, H. Prodinger, and C. Martínez. Analysis of Hoare's FIND algorithm with median-of-three partition. Random Structures & Algorithms, 10(1):143-156, 1997.
7. D.E. Knuth. Mathematical analysis of algorithms. In Information Processing '71, Proc. of the 1971 IFIP Congress, pages 19-27, Amsterdam, 1972. North-Holland.
8. rd edition, 1997.
9. nd edition, 1998.
10. H.M. Mahmoud. Sorting: A Distribution Theory. John Wiley & Sons, New York, 2000.
11. nd Col. on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, Trends in Mathematics, pages 329-340. Birkhäuser Verlag, 2002.
12. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004. Accepted for publication.
13. C. Martínez and S. Roura. Optimal sampling strategies in quicksort and quickselect. SIAM J. Comput., 31(3):683-705, 2001.
14. R. Sedgewick. The analysis of quicksort programs. Acta Informatica, 7:327-355, 1976.
15. R. Sedgewick. Implementing quicksort programs. Comm. ACM, 21:847-856, 1978.
16. R. Sedgewick. Quicksort. Garland, New York, 1978.
17. R. Sedgewick and Ph. Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, Mass., 1996.
18. R.C. Singleton. Algorithm 347: An efficient algorithm for sorting with minimal storage. Comm. ACM, 12:185-187, 1969.