News for hackers. Stuff that matters.
Re:Compressing Scrabble Dictionaries by bradleyjg on Wednesday June 04, 2014 @11:53AM (#7846292)
If n is the number of keys in the dictionary, then the whole procedure would not be O(n log n), it'd be O(m log n) where m is the number of letters. Given that n >> m, I would think your original statement is correct.

There are no comments on this comment yet.