a/HashMaps
1
0
Fork 0
mirror of https://codeberg.org/andyscott/HashMaps.git synced 2024-12-21 12:33:10 -05:00
Code Issues Projects Releases Packages Wiki Activity

Update README.md

Browse source
This commit is contained in:
Andrew Scott 2022-06-03 13:30:12 -04:00
parent df3117dc8a
commit 300c0f02dc
Signed by: a
GPG key ID: 3EB62D0BBB8DB381
1 changed files with 4 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
README.md
View file

@ -2,4 +2,7 @@
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.
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.