Engineering a sort function

Software: Practice and Experience

Volumn 23, Issue 11, 1993, Pages 1249-1265

  Bentley, Jon L ^a   McIlroy, M Douglas ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Algorithm design and implementation; Performance tuning; Quicksort; Sorting algorithms; Testing

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; DESIGN; SOFTWARE ENGINEERING; TESTING;

PERFORMANCE TUNING; QUICKSORT; SORT FUNCTION; SORTING ALGORITHM;

C (PROGRAMMING LANGUAGE);

EID: 0027693789     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.4380231105     Document Type: Article

References (28)

1. Quicksort
2. Algorithm 271: quickersort
3. Software exploratorium: the trouble with qsort
4. Software exploratorium: history of a heapsort
5. Implementing quicksort programs
6. Quicksort with equal keys
7. The analysis of quicksort programs
8. Bibliography 26: computer sorting
9. Structured programming with goto statements
10. An elementary C cost model
11. A retargetable compiler for ANSI C
12. Theory and practice in the construction of a working sort routine
13. Algorithm 347: an efficient algorithm for sorting with minimal storage
14. A framework for adaptive sorting
15. Quicksort for equal keys
16. The errors of Tex
17. Comments on the nature of automatic quadrature routines