mirror of
https://codeberg.org/andyscott/HashMaps.git
synced 2024-09-17 22:48:08 -04:00
466 B
466 B
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.