Hash tables are one of the most useful data structures. Their quick and scalable insert, search and delete make them relevant to a large number of computer science problems. Understanding of how a fundamental data structure works under the hood. Deeper knowledge of when to use hash tables, when not to use them, and how they can fail. Exposure to new C code. The language doesn't come with one included. It is a low-level language, so you get deeper exposure to how things work at a machine level. The full implementation is around 200 lines of code, and should take around an hour or two to work through. This tutorial assumes some familiarity with programming and C syntax. The code itself is relatively straightforward, and most issues should be solvable with a web search. A hash table is a data structure which offers a fast implementation of the associative array API.
Features
- Learn how to write a hash table in C
- Understand how a fundamental data structure works under the hood
- Exposure to new C code
- C is a great language to write a hash table
- The full implementation is around 200 lines of code
- Handle collisions