From 84a6f231869faa9eb9f2d5bb9dfcc4e483234537 Mon Sep 17 00:00:00 2001
From: Andrew Scott <git@acscott.dev>
Date: Sun, 5 Jun 2022 00:14:15 -0400
Subject: [PATCH] Update README

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 3a52313..ac896d8 100644
--- a/README.md
+++ b/README.md
@@ -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 
 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.
+frequently in the hash map and how many times it occurs with an O(n) time complexity.