simple hash functions in go: a simple hash function implementing Horner's rule and a universal hash function implementing the Carter-Wegman method.

LeMac - A fast AES-based universal hash function and MAC.

Hazz, a pseudo-random-data-filled-table, to generate k indipendent and uniform, very fast hash functions.

Implementation of a perfect hashing data structure. We say a hash function is perfect for S if all lookups involve O(1) work.

Asino a stubborn, simple and fast Bloom filter for the rest of us.

Merge Sort-Insertion Sort-Heap Sort- Hash Table algorithms are included in these projects.

Impelementation for some Perfect hashing algorithms

PolymurHash port in Zig.

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.

Different algorithms and data structures implementations.