From 4f02a094624777791fb9d7b2bae8e4c4114d3c7d Mon Sep 17 00:00:00 2001
From: Benn Tan <btjm123@gmail.com>
Date: Sun, 11 Aug 2024 05:09:15 +0800
Subject: [PATCH] Update README.md

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

diff --git a/README.md b/README.md
index aaf1142..f3adc64 100644
--- a/README.md
+++ b/README.md
@@ -75,6 +75,11 @@ Load Average: 1.78, 2.28, 2.49
 
 To be very honest, I'm not very sure how to explain this graph. 
 
+## Future
+- Quadratic Probing
+- Double Hashing
+- Implement `.start()` and `.end()`
+
 My initial hypothesis:  While resizing the table introduces a temporary performance drop due to a complete rehashing, the cost of resizing is amortized across many find operations invoked later (hence the performance increase). 
 
 I'll be happy to be proven wrong though/offered alternative ideas (and how to prove them).