3 ms·
Agreed. Well, in theory you may have conflicts in the bucket. And recovering the bucket means a round-trip to memory, which is much more expensive than runnin
by ArnoVW 4y ago
Agreed.
Well, in theory you may have conflicts in the bucket.
And recovering the bucket means a round-trip to memory, which is much more expensive than running over a list.
And in any case, "n" is the length of the word, but has nothing to do with the distribution of the dictionary. So one should use a "m" to capture that.
- sjducb 4y agoI thought that too The list of dictionary words isn't that big, so you can just have a long hash to reduce your conflicts to almost 0. Also words aren't that long. The longest English word is probably less than 100 characters, whereas you could feed trillions of strings into the algorithm.