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

Browse source
This commit is contained in:
Andrew Scott 2022-06-05 00:11:45 -04:00
parent d158786cdc
commit 874fb434d8
Signed by: a
GPG key ID: 3EB62D0BBB8DB381
1 changed files with 9 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
README.md
View file

@ -1,8 +1,11 @@
# 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.
These two hash map implementations feature open addressing with quadratic probing
and separate chaining to handle collisions. The a6\_include module provides the
underlying data structures, and two hash functions.
Both implementations use the included DynamicArray class for the underlying hash table,
however hash\_map\_sc.py uses a singly linked list for each bucket while hash\_map\_oa.py
uses a HashEntry object. Additionally, hash\_map\_sc.py includes a seperate function,
find\_mode(), that provides a mechanism for finding the value that occurs most
frequently in the hash map and how many times it occurs.