Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 12:16:14 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
bt3gl 2023-08-08 20:30:00 -07:00 committed by GitHub
parent 4b58e7b308
commit 8e2ee50f0e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
hash_objects/README.md
View File

@ -114,7 +114,7 @@ class HashSet:
* space complexity is `O(K+M)`, where `K` is the number of predefined buckets, and `M` is the number of unique values that have been inserted in the HashSet.
* lastly, to optimize search, we could maintain the buckets as sorted lists (and obtain `O(log(N))` time complexity for the lookup operation).
* however, `insert` and `delete` are linear time (as elements would need to be shifted).
* however, `insert` and `delete` are linear time (as elements would need to be shifted).
<br>