Bug 6: Almost A Radix Sort
- We are radix sorting two-byte unsigned integers.
- First we sort by the low byte. Then we sort by the high byte.
- In both cases we apply a stable counting sort.
- Because the second sort is stable, the low byte breaks ties in the high byte.
Fix The Tiny Bug In This Go Code: