| Running
time of Radixsort |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | How
many passes? |
||||||||||||
| • | How
much work per pass? |
||||||||||||
| • | Total
time? |
||||||||||||
| • | Conclusion |
||||||||||||
| – | Not
truly linear if K is large. |
||||||||||||
| • | In
practice |
||||||||||||
| – | RadixSort
only good for large number of items, |
||||||||||||
| relatively
small keys |
|||||||||||||
| – | Hard
on the cache, vs. MergeSort/QuickSort |
||||||||||||
