HashMaps/README.md

# 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.
Initial commit 2022-05-31 23:13:31 -04:00			`# HashMaps`

Update README 2022-05-31 23:16:48 -04:00			`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`
Update README.md 2022-06-03 13:30:12 -04:00			`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.`