Updating READMEs

Author: LyangHiga

README.md

@@ -1,48 +1,50 @@
 # TypeScript-Algorithms-and-Data-Structures
 
-This Repo, at first, was only for [JavaScript Algorithms and Data Structures Masterclass](https://www.udemy.com/course/js-algorithms-and-data-structures-masterclass/).
+Collection of classical algorithms and data structures in TypeScript.
 
-But the objective of this project has increased, I want to implement algorithms and popular data structures in TypeScript/ JavaScript and solve programming assignments for popular online courses. 
+For each folder, there is an MD file with my main References for that section. But my favorite ones are:
 
-For each folder, there is a MD file with my main References for that section.
+- [Algorithms Specialization](https://www.coursera.org/specializations/algorithms).
+  - Example test case files are available in: [stanford-algs](https://github.com/beaunus/stanford-algs).
+    Programming assignment solutions are not available in order to respect Coursera Honor Code.
+- [MIT 6.006 Introduction to Algorithms](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/)
+- [MIT 6.046J Design and Analysis of Algorithms](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/)
+- [Introduction to Algorithms, 3rd Edition - CLRS](https://en.wikipedia.org/wiki/Introduction_to_Algorithms)
+- [Algorithm Design, 1st Edition](https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358)
 
-### [Algorithms Specialization](https://www.coursera.org/specializations/algorithms).
-
-You can found Example Test Cases: [stanford-algs](https://github.com/beaunus/stanford-algs).
-
-Programming assignment solutions are not available in order to respect Coursera Honor Code.
+---
 
 ### Data Structures
 
 ##### Basics:
 
-- [Linked List](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/basics/linkedList.ts)
-- [Doubly Linked List](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/basics/doublyList.ts)
-- [Queue](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/basics/queue.ts)
-- [Stack](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/basics/stack.ts)
+- [Linked List](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/basics/linkedList.ts)
+- [Doubly Linked List](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/basics/doublyList.ts)
+- [Queue](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/basics/queue.ts)
+- [Stack](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/basics/stack.ts)
 
 ##### Trees:
 
-- [Binary Search Tree](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/trees/binarySearchTree.ts)
-- [AVL Tree](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/trees/avlTree.ts)
-- [Red Black Tree](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/trees/redBlackTree.ts)
+- [Binary Search Tree](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/trees/binarySearchTree.ts)
+- [AVL Tree](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/trees/avlTree.ts)
+- [Red Black Tree](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/trees/redBlackTree.ts)
 
 ##### Heaps:
 
-- [Min Binary Heap](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/heaps/minHeap.)
-- [Max Binary Heap](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/heaps/maxBinaryHeap.ts)
-- [Min Fibonacci Heap](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/heaps/fibonacciHeap.ts)
+- [Min Binary Heap](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/heaps/minHeap.)
+- [Max Binary Heap](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/heaps/maxBinaryHeap.ts)
+- [Min Fibonacci Heap](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/heaps/fibonacciHeap.ts)
 
 ##### Hash Tables:
 
-- [Separate Chaining](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/data-structures/hash-tables/hashTable.ts)
+- [Separate Chaining](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/hash-tables/hashTable.ts)
 
 ##### Disjoint-set (Union-Find):
 
-- [Linked List Representation](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/data-structures/disjoint-sets/listSet.ts)
-- [Forest Representation](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/data-structures/disjoint-sets/forestSet.ts)
+- [Linked List Representation](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/disjoint-sets/listSet.ts)
+- [Forest Representation](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/disjoint-sets/forestSet.ts)
 
-##### [Graph:](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/data-structures/graph/graph.ts)
+##### [Graph:](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/graph/graph.ts)
 
 - Karger Minimum Cut
 - BFS
@@ -62,40 +64,40 @@ To visualize some Pathfinding Algorithms check: [Pathfinding Visualizer](https:/
 
 ### Sorting
 
-- [Bubble Sort](https://github.com/LyangHiga/JavaScript-Algorithms-and-Data-Structures-Masterclass/blob/master/sort/bubbleSort.ts)
-- [Insertion Sort](https://github.com/LyangHiga/JavaScript-Algorithms-and-Data-Structures-Masterclass/blob/master/sort/insertionSort.ts)
-- [Selection Sort](https://github.com/LyangHiga/JavaScript-Algorithms-and-Data-Structures-Masterclass/blob/master/sort/selectionSort.ts)
-- [Heap Sort](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/sort/heapSort.ts)
-- [Merge Sort](https://github.com/LyangHiga/JavaScript-Algorithms-and-Data-Structures-Masterclass/blob/master/sort/mergeSort.ts)
-- [Quick Sort](https://github.com/LyangHiga/JavaScript-Algorithms-and-Data-Structures-Masterclass/blob/master/sort/quickSort.ts)
-- [Radix Sort](https://github.com/LyangHiga/JavaScript-Algorithms-and-Data-Structures-Masterclass/blob/master/sort/radixSort.ts)
+- [Bubble Sort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/bubbleSort.ts)
+- [Insertion Sort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/insertionSort.ts)
+- [Selection Sort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/selectionSort.ts)
+- [Heap Sort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/heapSort.ts)
+- [Merge Sort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/mergeSort.ts)
+- [Quick Sort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/quickSort.ts)
+- [Radix Sort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/radixSort.ts)
 
 To visualize some of them check [Sorting Visualizer](https://lyanghiga.github.io/sorting-visualizer/)
 
 ### Divide and Conquer
 
-- [Karatsuba Multiplication](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/divide-and-conquer/karatsuba.ts)
-- [Merge Sort](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/sort/mergeSort.ts)
-- [Counting Inversions](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/divide-and-conquer/countingInversions.ts)
-- [Maximum Sum Subarray Problem](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/divide-and-conquer/maxSubarr.ts)
-- [Closest Pair of Points Problem](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/divide-and-conquer/closestPair.ts)
-- [Quicksort](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/sort/quickSort.ts)
-- [Linear Time Selection: Random and Deterministic](https://github.com/LyangHiga/javaScript-algorithms-data-structures/blob/master/divide-and-conquer/selection.ts)
+- [Karatsuba Multiplication](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/divide-and-conquer/karatsuba.ts)
+- [Merge Sort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/mergeSort.ts)
+- [Counting Inversions](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/divide-and-conquer/countingInversions.ts)
+- [Maximum Sum Subarray Problem](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/divide-and-conquer/maxSubarr.ts)
+- [Closest Pair of Points Problem](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/divide-and-conquer/closestPair.ts)
+- [Quicksort](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/sort/quickSort.ts)
+- [Linear Time Selection: Random and Deterministic](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/divide-and-conquer/selection.ts)
 
 ### Greedy
 
-- [Dijkstra](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/data-structures/graph.ts)
-- [Prim](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/data-structures/graph.ts)
-- [Kruskal - Single-Link Clustering](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/data-structures/graph.ts)
-- [Scheduling Application](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/greedy/scheduling/scheduling.ts)
-- [Huffman Coding](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/greedy/huffman-coding/huffman.ts)
-- [Nearest Neighbor Heuristic TSP](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/tsp/tsp.ts)
+- [Dijkstra](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/graph.ts)
+- [Prim](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/graph.ts)
+- [Kruskal - Single-Link Clustering](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/graph.ts)
+- [Scheduling Application](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/greedy/scheduling/scheduling.ts)
+- [Huffman Coding](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/greedy/huffman-coding/huffman.ts)
+- [Nearest Neighbor Heuristic TSP](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/tsp/tsp.ts)
 
 ### Dynamic Programming
 
-- [Weighted Interval Scheduling](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/dynamic-programming/weighted-interval-scheduling/wis.ts)
-- [Max Weight Independent Set](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/dynamic-programming/mwis.ts)
-- [Knapsack](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/dynamic-programming/knapsack/knapsack.ts)
-- [Sequence Alignment](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/dynamic-programming/sequenceAlignment.ts)
-- [Bellman-Ford](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/data-structures/graph.ts)
-- [Floyd-Warshall](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/data-structures/graph.ts)
+- [Weighted Interval Scheduling](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/dynamic-programming/weighted-interval-scheduling/wis.ts)
+- [Max Weight Independent Set](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/dynamic-programming/mwis.ts)
+- [Knapsack](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/dynamic-programming/knapsack/knapsack.ts)
+- [Sequence Alignment](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/dynamic-programming/sequenceAlignment.ts)
+- [Bellman-Ford](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/graph.ts)
+- [Floyd-Warshall](https://github.com/LyangHiga/typescript-algorithms-data-structures/blob/master/src/data-structures/graph.ts)