From 300c0f02dc039a5ecd63ece0aa0eab72eaeb3ef6 Mon Sep 17 00:00:00 2001
From: Andrew Scott <git@acscott.dev>
Date: Fri, 3 Jun 2022 13:30:12 -0400
Subject: [PATCH] Update README.md

---
 README.md | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 482eff9..a7fa710 100644
--- a/README.md
+++ b/README.md
@@ -2,4 +2,7 @@
 
 These HashMap implementations were my final project for **CS 261 - Data Structures**
 at Oregon Sate. hash\_map\_oa.py features open addressing with quadratic probing
-while hash\_map\_sc.py uses separate chaining.
+while hash\_map\_sc.py uses separate chaining to handle collisions. Both implementations
+use a dynamic array for the underlying hash table, however hash\_map\_sc.py uses a
+singly linked list for each bucket, and hash\_map\_oa.py uses a single HashEntry
+object at each index of the array.