Radix Sorting ( string sorting )
¡C
Keys represented in base-M system (M : radix)¡C
Process + compare piece of keys vs compare + exchangebits ( x , k , j ) : = ( x div
¡C
M = 2
A 00001 |
A 00001 |
A 00001 |
A 00001 |
A 00001 |
A 00001 |
S 10011 |
E 00101 |
E 00101 |
A 00001 |
A 00001 |
A 00001 |
O 01111 |
O 01111 |
A 00001 |
E 00101 |
E 00101 |
E 00101 |
R 10010 |
L 01100 |
E 00101 |
E 00101 |
E 00101 |
E 00101 |
T 10100 |
M 01101 |
G 00111 |
G 00111 |
G 00111 |
|
I 01001 |
I 01001 |
I 01001 |
I 01001 |
||
N 01110 |
N 01110 |
N 01110 |
N 01110 |
L 01100 |
L 01100 |
G 00111 |
G 00111 |
M 01101 |
M 01101 |
M 01101 |
M 01101 |
E 00101 |
E 00101 |
L 01100 |
L 01100 |
N 01110 |
N 01110 |
X 11000 |
A 00001 |
O 01111 |
O 01111 |
O 01111 |
O 01111 |
A 00001 |
X 11000 |
S 10011 |
S 10011 |
||
M 01101 |
T 10100 |
T 10100 |
R 10010 |
R 10010 |
R 10010 |
P 10000 |
P 10000 |
P 10000 |
P 10000 |
S 10011 |
S 10011 |
L 01100 |
R 10010 |
R 10010 |
T 10100 |
||
E 00101 |
S 10011 |
X 11000 |
¡@