Hacker News new | ask | show | jobs
by zamadatix 2307 days ago
If you're going to sort the hashes then might as well make a jump table of the first n bits and a binary search from there.
1 comments

Why do you even need the jump table? If the hash function is working you should get quite close just by dead reckoning.