Update README

This commit is contained in:
Andrew Scott 2022-06-05 00:14:15 -04:00
parent 874fb434d8
commit 84a6f23186
Signed by: a
GPG key ID: 3EB62D0BBB8DB381

View file

@ -8,4 +8,4 @@ Both implementations use the included DynamicArray class for the underlying hash
however hash\_map\_sc.py uses a singly linked list for each bucket while hash\_map\_oa.py 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, 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. frequently in the hash map and how many times it occurs with an O(n) time complexity.