diff --git a/README.md b/README.md
index f1efbe4..7d90778 100644
--- a/README.md
+++ b/README.md
@@ -75,12 +75,12 @@ Load Average: 1.78, 2.28, 2.49
 
 To be very honest, I'm not very sure how to explain this graph. 
 
+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).
+
 ## Future
 - Quadratic Probing
 - Double Hashing
 - Implement `.start()` and `.end()`
 - Create my own `LinkedList` instead of using `std::list` for **ChainingHashMap**
-
-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).