201 reputation
13
bio website
location London, United Kingdom
age 29
visits member for 2 years, 3 months
seen Oct 4 at 0:39

Jul
18
comment Why isn't Radix Sort used more often?
Radix sort is frequently used in soft real-time systems such as games. Whether or not one algorithm outperforms another is, as usual, dependent on all the parameters of the problem, not just the complexity bound
Jul
18
comment Why isn't Radix Sort used more often?
Note on universality: Radix sort is fully capable of operating on floating-point keys, as well as variable-length integer keys
Jul
18
comment Why isn't Radix Sort used more often?
Note on the complexity stated: although (LSD) Radix sort has a complexity of O(n*K), this constant is usually small, typically chosen such that (2^(W/K))*C fits into L1, where C is the size in bytes of the counter, W the size of the key being sorted. Most implementations choose K=[3,4] for 32-bit words on x86. K can also be made adaptive to exploit temporal coherence (near-sortedness), as each radix is sorted individually.
Aug
23
awarded  Yearling
Mar
22
awarded  Nice Answer
Oct
18
awarded  Editor
Oct
18
awarded  Teacher
Oct
18
revised Is there an opposite for the term “Backporting”?
deleted 41 characters in body
Oct
18
answered Is there an opposite for the term “Backporting”?