|
1 | | -# algorithm-basics |
| 1 | +# Cooper Black's Algorithm Basics |
| 2 | +Learn and explore about the algorithms commonly studied in algorithm-related courses at the undergraduate level of university academics. |
| 3 | + |
| 4 | +As a glossary, these are the current algorithms available: |
| 5 | + |
| 6 | +- Sorting |
| 7 | + - [Bubble Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/bubble-sort.txt) |
| 8 | + - [Bucket Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/bucket-sort.txt) |
| 9 | + - [Merge Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/merge-sort.txt) |
| 10 | + - [Quick Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/quick-sort.txt) |
| 11 | + - [Topological Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Sorting/topological-sort.txt) |
| 12 | +- Graphs |
| 13 | + - [Breadth-First Search (BFS)](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-bfs.txt) |
| 14 | + - [Depth-First Search (DFS)](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-dfs.txt) |
| 15 | + - [Dijkstra's Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-dijkstra.txt) |
| 16 | + - [Kruskal's Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-kruskal.txt) |
| 17 | + - [Prim's Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-prim.txt) |
| 18 | + - [Kahn's Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-kahn.txt) |
| 19 | + - [Bellman-Ford Algorithm](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-bellman-ford.txt) |
| 20 | + - [Graph Coloring](https://github.com/cooperblacks/algorithm-basics/blob/main/Graphs/graph-coloring.txt) |
| 21 | +- Heaps |
| 22 | + - [Heapify](https://github.com/cooperblacks/algorithm-basics/blob/main/Heaps/heapify.txt) |
| 23 | + - [Heap Insertion](https://github.com/cooperblacks/algorithm-basics/blob/main/Heaps/heap-insert.txt) |
| 24 | + - [Heap Sort](https://github.com/cooperblacks/algorithm-basics/blob/main/Heaps/heap-sort.txt) |
| 25 | +- Hash Tables |
| 26 | + - [Collision Resolution via Chaining](https://github.com/cooperblacks/algorithm-basics/blob/main/Hash%20Tables/ht-chaining.txt) |
| 27 | + - [Separate Chaining](https://github.com/cooperblacks/algorithm-basics/blob/main/Hash%20Tables/ht-sep-chain.txt) |
| 28 | + - [Open Addressing](https://github.com/cooperblacks/algorithm-basics/blob/main/Hash%20Tables/ht-op-addr.txt) |
| 29 | +- Greedy Algorithms |
| 30 | + - [Activity Selection](https://github.com/cooperblacks/algorithm-basics/blob/main/Greedy/activity-selection.txt) |
| 31 | + - [Fractional Knapsack Problem](https://github.com/cooperblacks/algorithm-basics/blob/main/Greedy/fractional-knapsack.txt) |
| 32 | + - [Huffman Coding](https://github.com/cooperblacks/algorithm-basics/blob/main/Greedy/huffman-coding.txt) |
| 33 | +- Dynamic Programming |
| 34 | + - [Binary 1/0 Knapsack Problem](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/dp-binary-knapsack.txt) |
| 35 | + - [Longest Common Subsequence (LCS)](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/dp-lcs.txt) |
| 36 | + - [Matrix Multiplication](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/dp-matrix-mult.txt) |
| 37 | + - [Optimal Binary Search Tree (BST)](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/dp-optimal-bst.txt) |
| 38 | + - [Subset Sum](https://github.com/cooperblacks/algorithm-basics/blob/main/Dynamic%20Programming/subset-sum.txt) |
| 39 | +- Backtracking Algorithms |
| 40 | + - [N-Queens Problem](https://github.com/cooperblacks/algorithm-basics/blob/main/Backtracking/n-queens.txt) |
| 41 | + - [Subset Sum](https://github.com/cooperblacks/algorithm-basics/blob/main/Backtracking/subset-sum.txt) |
| 42 | +- Arithmetic |
| 43 | + - [Euclidean Greatest Common Divisor (GCD)](https://github.com/cooperblacks/algorithm-basics/blob/main/Arithmetic/euclid-gcd.txt) |
| 44 | + - [Extended Euclidean GCD](https://github.com/cooperblacks/algorithm-basics/blob/main/Arithmetic/euclid-gcd-extended.txt) |
| 45 | + - [Fast Fourier Transform (FFT) for Polynomial Multiplication](https://github.com/cooperblacks/algorithm-basics/blob/main/Arithmetic/fft-poly-mult.txt) |
| 46 | + |
| 47 | +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. |
0 commit comments