| Example: |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | 1-digit
numbers can be BinSorted |
|||||||||||
| • | 2 to
5-digit numbers can be BinSorted |
|||||||||||
| without
using too much memory |
||||||||||||
| • | 6-digit
numbers, broken up into A=first 3 |
|||||||||||
| digits,
B=last 3 digits. |
||||||||||||
| – | A and
B can reconstruct original 6-digits |
|||||||||||
| – | A and
B each RadixSortable as above |
|||||||||||
| – | A
more significant than B |
|||||||||||
