A set of efficient data structures in C, created in a generic way

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.

Basic data structures in C with useful comments and explanations

Implementation of data structures (Lists, Stacks, Queues, Trees, Balanced Search Trees, Hashing, Graphs); Implementation of algorithms (Sorting and searching, Recursion, Graph algorithms).

Resolves hash table collisions using linear probing, quadratic probing, and linear hashing. All data structures implemented from scratch. Optimized for efficient time and space complexity. Written in C++.

🔏 Service to store double hashed indexed records

A python program to evaluate the performance of Double Hashing & Red Black Tree and to show comparison between them.

This is an implementation of HashMap while tackling some collision resolution techniques.

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

Purely Functional Haskell vs Imperitive C, C++ and Python

Collision-free hash tables for the C programming language

Dictionary(ENG-TR) Using Hashing Algorithms

Implementation of Double hashing and robin hood hashing

Implementation of Common Data Structures in C++

Contains the implementation for a basic hashtable that allows linear probing and double hashing.

Enhanced double hashing in Rust

A Hash table written in javascript.

Comparison of the number of collisions caused by inserting keypairs in a hashtable with respect to Linear Probing and Double Hashing methods.

Trabalho que implementa um arquivo estruturado como uma tabela hash, utilizando-se o método de resolução de colisão Hashing Duplo (Double Hashing).