Engineering a Sort Function

Engineering a Sort Function (1993)

by Jon L. Bentley , M. Douglas Mcilroy

Citations:

58 - 1 self

@MISC{Bentley93engineeringa,
    author = {Jon L. Bentley and M. Douglas Mcilroy},
    title = {Engineering a Sort Function},
    year = {1993}
}

This paper summarizes its evolution

696	The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edition - Knuth - 1998
429	Algorithms - Sedgewick - 1988
160	2000), Programming Pearls - Bentley
87	Implementing Quicksort Programs - Sedgewick - 1978
47	The Errors of TeX - Knuth - 1989
40	Structured Programming with goto Statements - Knuth - 1974
22	A Discipline of - Dijkstra - 1976
20	A framework for adaptive sorting - Petersson, Moffat - 1995
17	T.A.: A research C# compiler - Hanson, Proebsting - 2004
15	Algorithm 347: An efficient algorithm for sorting with minimal storage - Singleton, C - 1969
14	Quicksort for Equal Keys - Wegner - 1985
12	Quicksort with equal keys - Sedgewick - 1977
9	Theory and practice in the construction of a working sort routine - Linderman - 1984
6	Comments on the nature of automatic quadrature routines - Lyness, Kaganove - 1976
5	Algorithm 271: QuickerSort - Scowen - 1965
3	Space efficient on-line selection algorithm - Weide - 1978
2	Software exploratorium: the trouble with qsort - Bentley - 1992
2	Software exploratorium: history of a heapsort - Bentley - 1992
1	McIlroy (eds - Kernighan, D - 1979
1	Bibliography 26: computer sorting - Rivest, Knuth - 1972
1	An elementary C cost model - Bentley, Kernighan, et al. - 1991
1	Optimistic sorting and information theoretic complexity - McIlroy - 1993