Radix Sort –
Very
Naughty
•
On each BinSort
–
Sweep through input list – cache misses along
the way (
sucky!
)
–
Append to output list – indexed by
pseudorandom digit (
ouch!
)
•
Truly evil for large Radix (e.g. 2
16
), which reduces #
of passes