- updated docs for chapter 2

Author: Isaac Ramirez

README.md

@@ -5,7 +5,7 @@ Personal notes and JavaScript code for the book Algorithms (4th edition) by Robe
 ## Chapters' Notes
 
 * [Chapter 1. Fundamentals](/docs/chapter-1.notes.md)
-* Chapter 2. Sorting
+* [Chapter 2. Sorting](/docs/chapter-2.notes.md)
 * Chapter 3. Searching
 * Chapter 4. Graphs
 * Chapter 5. Strings
@@ -69,11 +69,4 @@ _For a list similar to the book site see this [algorithms list](/docs/algorithms
 
 ## Exercise Solutions
 
-:warning: _Do **NOT** copy any of these solutions. These are for my reference only. You should have attempted to solve any of these exercises by your own after at least a few days before even trying to look for the solution. Finally, my solutions can be wrong too._
-
-* [Chapter 1. Fundamentals](/src/exercises/index.md)
-* Chapter 2. Sorting
-* Chapter 3. Searching
-* Chapter 4. Graphs
-* Chapter 5. Strings
-* Chapter 6. Context
+:warning: _Do **NOT** copy any of [these solutions](/src/exercises/index.md). These are for my reference only. You should have attempted to solve any of these exercises by your own after at least a few days before even trying to look for the solution. Finally, my solutions can be wrong too._

docs/algorithms-list.md

@@ -44,3 +44,26 @@ Every algorithm or ADT has a link pointing to the original Java implementation a
 * QuickUnionUF | [js](/src/algorithms/union-find-quick/union-find-quick.js) | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/QuickUnionUF.java.html) |
 * WeightedQuickUnionUF | [js](/src/algorithms/union-find-weighted/union-find-weighted.js) | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/WeightedQuickUnionUF.java.html) |
 * UF | js | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/UF.java.html) |
+
+### Chapter 2. Sorting
+
+* Insertion | js | java |
+* InsertionX | js | java |
+* BinaryInsertion | js | java |
+* Selection | js | java |
+* Shell | js | java |
+* Merge | js | java |
+* MergeBU | js | java |
+* MergeX | js | java |
+* Inversions | js | java |
+* Quick | js | java |
+* Quick3way | js | java |
+* QuickX | js | java |
+* QuickBentleyMcIlroy | js | java |
+* TopM | js | java |
+* MaxPQ | js | java |
+* MinPQ | js | java |
+* IndexMinPQ | js | java |
+* IndexMaxPQ | js | java |
+* Multiway | js | java |
+* Heap | js | java |

docs/chapter-2.notes.md

@@ -0,0 +1,9 @@
+# Algorithms (4th Edition)
+
+## Chapter 2. Sorting
+
+### Key Concepts
+
+#### A concept
+
+> Definition of the concept...