updated readme

Author: shadowcodex

readme.md

@@ -4,16 +4,6 @@ This is a repository dedicated to data structures and data theory for JavaScript
 
 If you are looking for the original repository for this, you can find it in the [original](/shadowcodex/data-theory/tree/original) branch.
 
-## Why did you wipe out the old repo?
-
-I moved the old repo to the `original` branch, because it can be slightly misleading. It was a project I started 2 years ago when I feel I wasn't as knowledgeable about JavaScript as I am now. I also have spent more time studying data theory and applications along with real world use cases with JavaScript in CryptoCurrency. So looking back I would have done things differently, but I wanted to keep the historical state of it preserved for comparisons.
-
-So I am starting fresh and am going to work to tackle different types of data structures. I'd like to also do instructional videos on these after writing them to go over their use cases, how they work, and different ways to do them if there are multiple ways.
-
-> For example there are a few ways to do stacks and queues in JavaScript, but one way (array based) requires linear time to make changes and another way (linked list based) takes constant time. What is the difference? Well that's something I hope to cover in videos after I get librarys and code.
-
-I want to walk the walk before I talk the talk. Using this repository.
-
 ## Benchmarks
 
 If you would like to see some benchmarks on these data structures then [click here...](/benchmark/README.md);
@@ -52,3 +42,7 @@ let queue = new queues.LinkedQueue();
 queue.enqueue('item');
 queue.dequeue();
 ```
+
+## What is the `original` branch?
+
+I moved the old repo to the `original` branch, this old repo was a different appraoch on how to do the data theory applications. I am redoing the entire repo and showing the new types and systems and making it importable.