Problem
1. If a hash function assigns 30 keys to random positions in a hash table of size 300, about how likely is it that there will be no collisions?
2. In radix sort, why are the keys usually partitioned first by the least significant position, not the most significant?