Update README.md

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).