Engineering quicksort

Computer Languages

Volumn 22, Issue 1, 1996, Pages 39-47

  Sarwar, S Mansoor ^a   Sarwar, Syed Aqeel ^b   Jaragh, Mansour H A ^c   Brandeburg, Jesse ^a  

^a UNIVERSITY OF PORTLAND   (United States)

^b NEW YORK INSTITUTE OF TECHNOLOGY   (United States)

^c KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Experimental algorithmics; Quicksort; Sorting algorithms

Indexed keywords

CODES (SYMBOLS); COMPUTER HARDWARE; PERFORMANCE; RESPONSE TIME (COMPUTER SYSTEMS); SORTING;

ENGINEERING QUICKSORT; EXPERIMENTAL ALGORITHMICS; INSERTION SORT; SORTING ALGORITHMS;

ALGORITHMS;

EID: 0030127255     PISSN: 00960551     EISSN: None     Source Type: Journal    
DOI: 10.1016/0096-0551(96)00005-7     Document Type: Article

References (12)

1. Hoare, C. A. R. "Quicksort". Comput. J. 5(1): 10-15; 1962.
2. Knuth, D. E. The Art of Computer Programming, Volume 3: Sorting and Searching Algorithms. Addison-Wesley: Reading MA; 1973.
3. Nievergelt, J. and Hinrichs, K. H. Algorithms and Data Structures. Prentice-Hall: Englewood Cliffs NJ; 1993.
4. Aho, A., Hopcroft, J. and Ullman J. D. Data Structures and Algorithms. Addison-Wesley: Reading MA; 1983.
5. Sedgewick, R. Algorithms. Addison-Wesley: Reading MA; 1988.
6. Weiss, M. A. Data Structures and Algorithm Analysis in C; Addison-Wesley: Reading MA; 1993.
7. Bentley, Jon L. and McIlroy M. Douglas. Engineering a sort function. Software: Prac. Exper. 23(11): 1249-1265; 1993.
8. Sarwar, S. Mansoor, Jaragh, Mansour H. A. and Wind, Mike. An empirical study of the run-time behavior of Quicksort, Shellsort, and Mergesort for medium to large size data. Comput. Lang. 20(2): 127-134; 1994.
9. Weiss, M. A. Empirical study of the expected running time of Shellsort. Comput. J. 34(1): 88-91; 1991.
10. Weiss, A. A. and Sedgewick, R. More on Shellsort increment sequences. Inform. Process. Lett. 34: 267-270; 1990.
11. Sedgewick, R. Implementing Quicksort programs. CACM 21(10): 847-857; 1978.
12. Sedgewick, R. The analysis of Quicksort programs. Acta Inform. 7: 327-355; 1977.