|
|
|
| What data types can you |
||
| RadixSort? |
||
|
|
|
|
|
|
|
|
|
|
|
|
| • | Any
type T that can be BinSorted |
||||||||||
| • | Any
type T that can be broken into parts A |
||||||||||
| and B, |
|||||||||||
| – | You
can reconstruct T from A and B |
||||||||||
| – | A can be RadixSorted |
||||||||||
| – | B can be RadixSorted |
||||||||||
| – | A is always more significant than B, in ordering |
||||||||||
