Re:Compressing Scrabble Dictionaries
by dbaupp on Wednesday June 04, 2014 @07:22PM
(#7849123)
Oh, so I guess it is strictly O(m log m + log n) if m is the number of letters. You can theoretically get it to be O(m log m) using a hashmap (makes lookups O(1)) or trie (lookups are O(m)).
[ Parent
| on HN ]
There are no comments on this comment yet.