Representation of how Hash Table looks with extendible hashing over the time as it grows with more data
-
Updated
Aug 17, 2025 - Java
Representation of how Hash Table looks with extendible hashing over the time as it grows with more data
An implementation of Dynamic Hashing methods as described in chapter 5 of 'Data Structures and Algorithms in C' by Mark Allan Weiss (Separate Chaining and Open Addressing)
⚡ A collection of C++ programs covering data structures, algorithms, and problem-solving techniques. Includes implementations of graph algorithms, dynamic hashing, matrix operations, pointer concepts, and more, making it a valuable resource for competitive programming and system-level programming. 🚀💻
There are two implementations available in this folder in C/C++. First one is of Dynamic Hashing using Binary Tree with Page size at each node. The second one is of Knuth Hash Function performance evaluation using a text file as input.
To associate your repository with the dynamic-hashing topic, visit your repo's landing page and select "manage topics."