2 ms·
Yep, also the insertion procedure is retried with increasingly larger arrays until no “collisions” are encountered. Reminds me of minimal perfect hash construc
by layoutIfNeeded 7y ago
Yep, also the insertion procedure is retried with increasingly larger arrays until no “collisions” are encountered.
Reminds me of minimal perfect hash construction.
- thomasmg 7y agoYes, the underlying theory is from a minimal perfect hash function called "BDZ": http://cmph.sourceforge.net/bdz.html http://cmph.sourceforge.net/bdz.html . Yes, sometimes a retry is needed, but the array is not made larger; it just retries with a different seed.