Implementation of a perfect hashing data structure. We say a hash function is perfect for S if all lookups involve O(1) work.
-
Updated
May 28, 2023 - Java
Implementation of a perfect hashing data structure. We say a hash function is perfect for S if all lookups involve O(1) work.
Hash functions and tables in Java
Implementing an English Dictionary as application on perfect hashing.
Implementation of a perfect hashing data structure using different space complexity solutions.
Add a description, image, and links to the universal-hashing topic page so that developers can more easily learn about it.
To associate your repository with the universal-hashing topic, visit your repo's landing page and select "manage topics."