| 
|
Quote: radix sort by bytes is faster than Quicksort
topics >
all references >
references c-d >
Topic:
sort algorithms
Quotation Skeleton
This paper presents an alternative algorithm [radix sort] for sorting fixed-length keys of arbitrary size, which typically performs … [p. 636] The keys to be sorted are partitioned … recursively sorted using successive bytes within keys. … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: sort algorithms (24 items)