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-25 13:47:52 -04:00
parent 84a6f23186
commit 78138056b6
Signed by: a
GPG key ID: 3EB62D0BBB8DB381
1 changed files with 2 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
README.md
View file

@ -1,7 +1,7 @@
# HashMaps # HashMaps
These two hash map implementations feature open addressing with quadratic probing These two hash map implementations feature open addressing with quadratic probing
and separate chaining to handle collisions. The a6\_include module provides the and separate chaining to handle collisions. The hm\_include module provides the
underlying data structures, and two hash functions. underlying data structures, and two hash functions.
Both implementations use the included DynamicArray class for the underlying hash table, Both implementations use the included DynamicArray class for the underlying hash table,
@ -9,3 +9,4 @@ however hash\_map\_sc.py uses a singly linked list for each bucket while hash\_m
uses a HashEntry object. Additionally, hash\_map\_sc.py includes a seperate function, 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 find\_mode(), that provides a mechanism for finding the value that occurs most
frequently in the hash map and how many times it occurs with an O(n) time complexity. frequently in the hash map and how many times it occurs with an O(n) time complexity.
Finally, both implementations include some basic testing when run as a script.