From 8e2ee50f0eb80322fc8a86309e4e4bb64014835f Mon Sep 17 00:00:00 2001 From: bt3gl <138340846+bt3gl-cryptographer@users.noreply.github.com> Date: Tue, 8 Aug 2023 20:30:00 -0700 Subject: [PATCH] Update README.md --- hash_objects/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/hash_objects/README.md b/hash_objects/README.md index f497498..dbb0bc4 100644 --- a/hash_objects/README.md +++ b/hash_objects/README.md @@ -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).