Hash maps using (Separate) Chaining, and Open Addressing with Quadratic Probing
Find a file
2022-06-03 14:07:40 -04:00
.gitignore Initial commit 2022-06-01 05:13:31 +02:00
a6_include.py Added skeleton code 2022-05-31 23:17:12 -04:00
hash_map_oa.py Added docstring for clear() 2022-06-02 22:44:35 -04:00
hash_map_sc.py Remove matplotlib import, update docstring for find_mode_put() 2022-06-03 14:07:40 -04:00
LICENSE Add name and year 2022-06-01 05:14:11 +02:00
README.md Update README.md 2022-06-03 13:30:12 -04:00

HashMaps

These HashMap implementations were my final project for CS 261 - Data Structures at Oregon Sate. hash_map_oa.py features open addressing with quadratic probing while hash_map_sc.py uses separate chaining to handle collisions. Both implementations use a dynamic array for the underlying hash table, however hash_map_sc.py uses a singly linked list for each bucket, and hash_map_oa.py uses a single HashEntry object at each index of the array.