Problem 8.3

[rualark]

This approach of reverse prefix sort will require too many buckets (kn, where k is number of unique symbols) if there is only one string of length n.

Alternative solution: sort strings by their length using bucket sort. Then prefix sort strings starting with longest strings and graduallybadding shorter strings, using normal prefix sort, but aligning strings by their first letter.