6 ms·
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.
by zamadatix 7y 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.
- thedance 7y agoWhy do you even need the jump table? If the hash function is working you should get quite close just by dead reckoning.