- update docs

Author: Isaac Ramirez

README.md

@@ -14,60 +14,9 @@ Personal notes and JavaScript code for the book Algorithms (4th edition) by Robe
 
 _For a list similar to the book site see this [algorithms list](/markdown/algorithms.md)._
 
-### Chapter 1. Fundamentals
-
-**Algorithms:**
-
-* [Euclid's - p. 4](/src/algorithms/euclidean/euclidean.js)
-* [BinarySearch - p. 47](/src/algorithms/binary-search/binary-search.js)
-* [LinearSearch - p. 48](/src/algorithms/linear-search/linear-search.js)
-* [Dijkstra's Two-Stack: Expression Evaluation - p. 129](/src/algorithms/dijkstra-two-stack/dijkstra-two-stack.js)
-* [ThreeSum - p. 173](/src/algorithms/three-sum/three-sum.js)
-* [TwoSumFast - p. 189](/src/algorithms/two-sum-fast/two-sum-fast.js)
-* [ThreeSumFast - p. 190](/src/algorithms/three-sum-fast/three-sum-fast.js)
-* [QuickFindUF - p. 221](/src/algorithms/union-find/union-find.js)
-* [QuickUnionUF - p. 224](/src/algorithms/union-find-quick/union-find-quick.js)
-* [WeightedQuickUnionUF - p. 228](/src/algorithms/union-find-weighted/union-find-weighted.js)
-
-**ADTs:**
-
-* [BasicDate - p. 79](/src/adts/basic-date/basic-date.js)
-* [SmallDate - p. 79](/src/adts/small-date/small-date.js)
-* [Transaction - p. 79](/src/adts/transaction/transaction.js)
-* [Counter - p. 85](/src/adts/counter/counter.js)
-* [Accumulator - p. 93](/src/adts/accumulator/accumulator.js)
-* [FixedCapacityStack - p. 135](/src/adts/fixed-capacity-stack/fixed-capacity-stack.js)
-* [ResizingArrayStack - p. 141](/src/adts/resizable-array-stack/resizable-array-stack.js)
-* [Node - p. 142](/src/adts/node/node.js)
-* [Stack - p. 149](/src/adts/stack/stack.js)
-* [Queue - p. 151](/src/adts/queue/queue.js)
-* [Bag - p. 155](/src/adts/bag/bag.js)
-* [StopWatch - p. 175](/src/adts/stop-watch/stop-watch.js)
-
-### Chapter 2. Sorting
-
-**Algorithms:**
-
-* [Selection Sort - p. 249](/src/algorithms/selection-sort/selection-sort.js)
-* [Insertion Sort - p. 251](/src/algorithms/insertion-sort/insertion-sort.js)
-* [Shell Sort - p. 259](/src/algorithms/shell-sort/shell-sort.js)
-* [Merge Sort - p. 273](/src/algorithms/merge-sort/merge-sort.js)
-* [MergeBU Sort - p. 278](/src/algorithms/merge-sort-bu/merge-sort-bu.js)
-* [Quick Sort - p. 289](/src/algorithms/quick-sort/quick-sort.js)
-* [Quick3way Sort - p. 299](/src/algorithms/quick-3way-sort/quick-3way-sort.js)
-
-**ADTs:**
-
-* [MinPQ - p. 311](/src/adts/min-priority-queue/min-priority-queue.js)
-* [MaxPQ - p. 318](/src/adts/max-priority-queue/max-priority-queue.js)
-
-**Clients:**
-
-* [SortCompare - p. 256](/src/examples/test-clients/sort-compare.client.js)
-
 ## Exercise Solutions
 
-: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._
+:warning: _Do **NOT** copy any of my solutions, these are only for the future me. You should have attempted solving any of these exercises by your own at least for a couple of days before trying to look for a solution. My solutions can be **wrong**._
 
 ## Benchmarks
 

docs/markdown/algorithms.md

@@ -63,7 +63,7 @@ Every algorithm or ADT has a link pointing to the original Java implementation a
 * TopM | [js](/src/adts/min-priority-queue/min-priority-queue.client.js) | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/TopM.java.html) |
 * MaxPQ | [js](/src/adts/max-priority-queue/max-priority-queue.js) | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/MaxPQ.java.html) |
 * MinPQ | [js](/src/adts/min-priority-queue/min-priority-queue.js) | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/MinPQ.java.html) |
-* IndexMinPQ | js | java |
-* IndexMaxPQ | js | java |
-* Multiway | js | java |
-* Heap | js | java |
+* IndexMinPQ | [js](/src/adts/index-min-priority-queue/index-min-priority-queue.js) | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/IndexMinPQ.java.html) |
+* IndexMaxPQ | js | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/IndexMaxPQ.java.html) |
+* Multiway | [js](/src/adts/index-min-priority-queue/multiway.client.js) | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/Multiway.java.html) |
+* Heap | [js](/src/algorithms/heap-sort/heap-sort.js) | [java](https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/Heap.java.html) |