Multi-key quicksort
Multi-key quicksort, also known as three-way radix quicksort, is an algorithm for sorting strings. This hybrid of quicksort and radix sort was originally suggested by P. Shackleton, as reported in one of C.A.R. Hoare's seminal papers on quicksort; its modern incarnation was developed by Jon Bentley and Robert Sedgewick in the mid-1990s. The algorithm is designed to exploit the property that in many problems, strings tend to have shared prefixes. One of the algorithm's uses is the construction of suffix arrays, for which it was one of the fastest algorithms as of 2004.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Multi-key quicksort
Multi-key quicksort, also known as three-way radix quicksort, is an algorithm for sorting strings. This hybrid of quicksort and radix sort was originally suggested by P. Shackleton, as reported in one of C.A.R. Hoare's seminal papers on quicksort; its modern incarnation was developed by Jon Bentley and Robert Sedgewick in the mid-1990s. The algorithm is designed to exploit the property that in many problems, strings tend to have shared prefixes. One of the algorithm's uses is the construction of suffix arrays, for which it was one of the fastest algorithms as of 2004.
has abstract
Multi-key quicksort, also know ...... fastest algorithms as of 2004.
@en
Wikipage page ID
46,361,936
page length (characters) of wiki page
Wikipage revision ID
995,415,960
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Multi-key quicksort, also know ...... fastest algorithms as of 2004.
@en
label
Multi-key quicksort
@en