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.

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

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

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.

PolymurHash port in Zig.

Impelementation for some Perfect hashing algorithms

Hash functions and tables in Java

Different algorithms and data structures implementations.

Implementation of a perfect hashing data structure using different space complexity solutions.

Implementing an English Dictionary as application on perfect hashing.