Templated type-safe hashmap implementation in C using open addressing and linear probing for collision resolution.

Fast and memory-efficient immutable collections and helper data structures

An open addressing linear probing hash table, tuned for delete heavy workloads

A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.

A lightweight single-header open-addressing hashtable implementation in ANSI C

Comparison of Hashing Algorithms - Double Hashing, Robin Hood Hashing Cuckoo Hashing with Java's inbuilt HashMap/ HastSet over million of add(), contains() and remove() operations.

Data structures and algorithms implementation in pure C#!

Yet another efficient hashmap implementation for Golang based on the hopscotch open addressing scheme.

Implementing Hash-Table Lexicon using open-addressing and quadratic probing.

C Program For Open Address Collision

This repository contains all the data structures and their application in Java.

The project on comparison of different hashing approaches

Container with linear probing resolver collision using LCFS-hashing.

Simple alternative to hcreate_r, hsearch_r, hdestroy_r GNU extensions

Hash-Table implementation using Python. (Chaining, Open Addressing & Resizing)

Hash Table implementation using Open addressing & Linear probing.

Hash lib in C

In this project, I used CSV module to implement CRUD operations on CSV file using Python Programming Language. The CSV file has over 400,000 records of phone numbers. Searching them linearly may cause a lot of time. Therefore, I used Hash Table to search phone numbers in O(1).

🌳 A subtree occurrence finder implemented with an Open Addressing Hash Table in C.

Java project implementing various hashing techniques .