Update README.md

Author: cooperblacks

README.md

@@ -4,44 +4,46 @@ Learn and explore about the algorithms commonly studied in algorithm-related cou
 As a glossary, these are the current algorithms available:
 
 - Sorting
-  - [Bubble Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/bubble-sort.txt)
-  - [Bucket Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/bucket-sort.txt)
-  - [Merge Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/merge-sort.txt)
-  - [Quick Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/quick-sort.txt)
-  - [Topological Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/topological-sort.txt)
+  - [Bubble Sort](/Sorting/bubble-sort.txt)
+  - [Selection Sort](/Sorting/selection-sort.txt)
+  - [Insertion Sort](/Sorting/insertion-sort.txt)
+  - [Bucket Sort](/Sorting/bucket-sort.txt)
+  - [Merge Sort](/Sorting/merge-sort.txt)
+  - [Quick Sort](/Sorting/quick-sort.txt)
+  - [Topological Sort](/Sorting/topological-sort.txt)
 - Graphs
-  - [Breadth-First Search (BFS)](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-bfs.txt)
-  - [Depth-First Search (DFS)](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-dfs.txt)
-  - [Dijkstra's Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-dijkstra.txt)
-  - [Kruskal's Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-kruskal.txt)
-  - [Prim's Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-prim.txt)
-  - [Kahn's Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-kahn.txt)
-  - [Bellman-Ford Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-bellman-ford.txt)
-  - [Graph Coloring](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-coloring.txt)
+  - [Breadth-First Search (BFS)](/Graphs/graph-bfs.txt)
+  - [Depth-First Search (DFS)](/Graphs/graph-dfs.txt)
+  - [Dijkstra's Algorithm](/Graphs/graph-dijkstra.txt)
+  - [Kruskal's Algorithm](/Graphs/graph-kruskal.txt)
+  - [Prim's Algorithm](/Graphs/graph-prim.txt)
+  - [Kahn's Algorithm](/Graphs/graph-kahn.txt)
+  - [Bellman-Ford Algorithm](/Graphs/graph-bellman-ford.txt)
+  - [Graph Coloring](/Graphs/graph-coloring.txt)
 - Heaps
-  - [Heapify](https://github.com/cooperblacks/algorithm-basics/blob/main/Heaps/heapify.txt)
-  - [Heap Insertion](https://github.com/cooperblacks/algorithm-basics/blob/main/Heaps/heap-insert.txt)
-  - [Heap Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Heaps/heap-sort.txt)
+  - [Heapify](/Heaps/heapify.txt)
+  - [Heap Insertion](/Heaps/heap-insert.txt)
+  - [Heap Sort](/Heaps/heap-sort.txt)
 - Hash Tables
-  - [Collision Resolution via Chaining](https://github.com/cooperblacks/algorithm-basics/blob/main/Hash%20Tables/ht-chaining.txt)
-  - [Separate Chaining](https://github.com/cooperblacks/algorithm-basics/blob/main/Hash%20Tables/ht-sep-chain.txt)
-  - [Open Addressing](https://github.com/cooperblacks/algorithm-basics/blob/main/Hash%20Tables/ht-op-addr.txt)
+  - [Collision Resolution via Chaining](/Hash%20Tables/ht-chaining.txt)
+  - [Separate Chaining](/Hash%20Tables/ht-sep-chain.txt)
+  - [Open Addressing](/Hash%20Tables/ht-op-addr.txt)
 - Greedy Algorithms
-  - [Activity Selection](https://github.com/cooperblacks/algorithm-basics/blob/main/Greedy/activity-selection.txt)
-  - [Fractional Knapsack Problem](https://github.com/cooperblacks/algorithm-basics/blob/main/Greedy/fractional-knapsack.txt)
-  - [Huffman Coding](https://github.com/cooperblacks/algorithm-basics/blob/main/Greedy/huffman-coding.txt)
+  - [Activity Selection](/Greedy/activity-selection.txt)
+  - [Fractional Knapsack Problem](/Greedy/fractional-knapsack.txt)
+  - [Huffman Coding](/Greedy/huffman-coding.txt)
 - Dynamic Programming
-  - [Binary 1/0 Knapsack Problem](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/dp-binary-knapsack.txt)
-  - [Longest Common Subsequence (LCS)](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/dp-lcs.txt)
-  - [Matrix Multiplication](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/dp-matrix-mult.txt)
-  - [Optimal Binary Search Tree (BST)](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/dp-optimal-bst.txt)
-  - [Subset Sum](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/subset-sum.txt)
+  - [Binary 1/0 Knapsack Problem](/Dynamic%20Programming/dp-binary-knapsack.txt)
+  - [Longest Common Subsequence (LCS)](/Dynamic%20Programming/dp-lcs.txt)
+  - [Matrix Multiplication](/Dynamic%20Programming/dp-matrix-mult.txt)
+  - [Optimal Binary Search Tree (BST)](/Dynamic%20Programming/dp-optimal-bst.txt)
+  - [Subset Sum](/Dynamic%20Programming/subset-sum.txt)
 - Backtracking Algorithms
-  - [N-Queens Problem](https://github.com/cooperblacks/algorithm-basics/blob/main/Backtracking/n-queens.txt)
-  - [Subset Sum](https://github.com/cooperblacks/algorithm-basics/blob/main/Backtracking/subset-sum.txt)
+  - [N-Queens Problem](/Backtracking/n-queens.txt)
+  - [Subset Sum](/Backtracking/subset-sum.txt)
 - Arithmetic
-  - [Euclidean Greatest Common Divisor (GCD)](https://github.com/cooperblacks/algorithm-basics/blob/main/Arithmetic/euclid-gcd.txt)
-  - [Extended Euclidean GCD](https://github.com/cooperblacks/algorithm-basics/blob/main/Arithmetic/euclid-gcd-extended.txt)
-  - [Fast Fourier Transform (FFT) for Polynomial Multiplication](https://github.com/cooperblacks/algorithm-basics/blob/main/Arithmetic/fft-poly-mult.txt)
+  - [Euclidean Greatest Common Divisor (GCD)](/Arithmetic/euclid-gcd.txt)
+  - [Extended Euclidean GCD](/Arithmetic/euclid-gcd-extended.txt)
+  - [Fast Fourier Transform (FFT) for Polynomial Multiplication](/Arithmetic/fft-poly-mult.txt)
 
 That's all for now. Feel free to open an **issue** from the `⦿ Issues` tab (beside the `< > Code` tab) above for suggesting any other algorithms.