J.L. Bentley, M.D. McIlroy, Engineering a sort function, Software--Pract. Exper. 23 (1993) 1249--1265.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... is one of the most widely used general purpose sorting algorithms and was selected to be among the top ten most in uential algorithms in Science and Engineering in the 20th century; see JaJa [40] For more information on practical implementation and recent development of quicksort, see for example [5, 48, 74]. Assume that the input comes from a sequence of independent and identically distributed random variables with a common continuous distribution, the cost measures, say X n , on quicksort can generally be described by X 0 = 0 and for n 1 n 1 In T n ; 1) where (X n ) X n ) T n ; I n ....

J. L. Bentley and M. D. McIlroy, Engineering a sort function, Software{Practice and Experience, 23, 1249-1265 (1993).

....samples having no gain, as demonstrated by Sedgewick [102] and Hennequin [54] and the most successful variant is the median of three version due partly to simplicity of implementation and le size of most applications. Another interesting variant (inter alia) was introduced by Bentley and McIlroy [11]: instead of choosing the median of three elements as the pivot, they use the median of three elements each of which is the median of three elements and call this approximate median of nine the ninther, after J. W. Tukey [112] Note that for a random permutation of nine elements, the ninther ....

....ninther The ninther was rst introduced by J. W. Tukey [112] as a quick, robust summary of a sample (indeed he used the median of many ninthers) When used in quicksort, we choose rst a ninther and then partition the input in the usual way and sort the sub les recursively; see Bentley and McIlroy [11] for a detailed description and implementation. Quicksort using ninther has been widely used in practical implementations; see for example [4, 74, 85] The general cost measures for this quicksort satisfy (35) with r = 9 and fp j g 0 j 9 = 0; 0; 0; 3 ; 0; 0; 0 Our theory applies. In ....

J. L. Bentley and M. D. McIlroy, Engineering a sort function, Software{Practice and Experience, 23 (1993), 1249-1265.

....an unusually large average lcp is an acceptable price to pay in exchange for the reduced space occupancy o ered by our algorithm. 2 De nitions and previous results Let T [1; n] denote a text over the alphabet . The sux array [16] or pat array [9] for T is an array SA[1; n] such that T [SA[1]; n] T [SA[2] n] etc. is the list of suxes of T sorted in lexicographic order. For example, for T = babcc then SA = 2; 1; 3; 5; 4] since T [2; 5] abcc is the sux with lower lexicographic rank, followed by T [1; 5] babcc, followed by T [3; 5] bcc and so on. Given two strings v; w we ....

....works in rounds. At the beginning of the ith round the suxes are already sorted according to the 2 ordering. In the ith round the algorithm looks for groups of suxes sharing the rst 2 characters and sorts them according to the 2 ordering using BentleyMcIlroy ternary quicksort [1]. Because of (1) each comparison in the quicksort algorithm takes O(1) time. After at most log n rounds all the suxes are sorted. Thanks to a very clever data organization qsufsort only uses 8n bytes. Even more surprisingly, the whole algorithm ts in two pages of clean and elegant C code. The ....

J. L. Bentley and M. D. McIlroy. Engineering a sort function. Software { Practice and Experience, 23(11):1249-1265, 1993.

.... is one of the most widely used general purpose sorting algorithms and is ranked as one of the top ten most in uential algorithms in Science and Engineering in the 20th century; see JaJa [39] For more information on practical implementation and recent development of quicksort, see for example [5, 47, 72]. Assume that the input comes from a sequence of independent and identically distributed random variables with a common continuous distribution, the cost measures, say X n , on quicksort can generally be described by X 0 = 0 and for n 1 X n d = X In X n 1 In T n ; 1) 1 The work of ....

J. L. Bentley and M. D. McIlroy, Engineering a sort function, Software{Practice and Experience, 23, 1249-1265 (1993).

....a human being. We present time measurements for MSD radixsort, Adaptive radixsort, and Forward radixsort with 8 bit and 16 bit alphabets. All of these algorithms have been implemented in a consistent way using linked lists. Furthermore, we make comparisons with competitive versions of quicksort [Bentley and McIlroy 1993], radix 10 Delta A. Andersson and S. Nilsson sort [McIlroy et al. 1993] and the recently introduced Multikey quicksort [Bentley and Sedgewick 1997] These results are harder to interpret since these implementations use an array data structure and some of them apply micro optimizations. Still, ....

....case it uses the same heuristic as FRS 16. In addition to these algorithms we have also studied several previously published sorting algorithms. Quicksort. Quicksort has a long history of implementation and optimization. The version engineered by Bentley and McIlroy seems to be the clear winner [Bentley and McIlroy 1993]. The algorithm is constructed to work for all kinds of input and hence has some overhead. We therefore used a stripped down version that is specifically tailored for character strings. Multikey. Multikey quicksort is a recent algorithm [Bentley and Sedgewick 1997] It may be viewed as an ....

[Article contains additional citation context not shown here]

Bentley, J. L. and McIlroy, M. D. 1993. Engineering a sort function. Software---Practice and Experience 23, 11, 1249--1265.

No context found.

J.L. Bentley, M.D. McIlroy, Engineering a sort function, Software--Pract. Exper. 23 (1993) 1249--1265.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC