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

dgraziotin

Daniel Graziotin is a PhD student in Computer Science at the Free University of Bozen-Bolzano. His research interests include human aspects in empirical software engineering with psychological measurements, Web engineering, and Open Science. He is Editorial Associate at the Journal of Open Research Software and the local coordinator of the OKFN Open science Italian group . He is a member of the ACM, SIGSOFT, IEEE, and the IEEE Computer Society. Read more about.

Leave a Reply

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