Hash Maps with linear probing and separate chaining

Time for two new C programs! At the DSA course I learned something about Hash Tables and collision resolutions.
I just implemented insert/search/print operations.

The first source code is an implementation of a Hash Map with open addressing (linear probing) as collision resolution method.
The following are the interesting functions of the program. As always, take a look at the source code for comments:

Download: hash-map-linear-probing

The second program is an implementation of a Hash Map with chaining as collision resolution method.

Interesting functions:

Download: hash-map-chaining.c

Published by


Daniel Graziotin is a doctoral researcher in computer science, software engineering at the Free University of Bozen-Bolzano, Italy. His research interests include human aspects in empirical software engineering with psychological measurements, Web engineering, and open science. He researches, publishes, and reviews for venues in software engineering, human-computer interaction, and psychology. Daniel is the founder of the psychoempirical software engineering discipline and guidelines. He is academic editor at the Research Ideas and Outcomes (RIO) journal and at the Open Communications in Computer Science journal. He is editorial associate at the Journal of Open Research Software and the local coordinator of the Italian Open science local group for the Open Knowledge Foundation. He is a member of the ACM, SIGSOFT, IEEE, and the IEEE Computer Society.

Leave a Reply

Your email address will not be published. Required fields are marked *