Cooper Black's Algorithm Basics

Learn and explore about the algorithms commonly studied in algorithm-related courses at the undergraduate level of university academics.

As a glossary, these are the current algorithms available:

• Sorting
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Bucket Sort
  • Merge Sort
  • Quick Sort
  • Topological Sort
• Graphs
  • Breadth-First Search (BFS)
  • Depth-First Search (DFS)
  • Dijkstra's Algorithm
  • Kruskal's Algorithm
  • Prim's Algorithm
  • Kahn's Algorithm
  • Bellman-Ford Algorithm
  • Graph Coloring
• Heaps
  • Heapify
  • Heap Insertion
  • Heap Sort
• Hash Tables
  • Collision Resolution via Chaining
  • Separate Chaining
  • Open Addressing
• Greedy Algorithms
  • Activity Selection
  • Fractional Knapsack Problem
  • Huffman Coding
• Dynamic Programming
  • Binary 1/0 Knapsack Problem
  • Longest Common Subsequence (LCS)
  • Matrix Multiplication
  • Optimal Binary Search Tree (BST)
  • Subset Sum
• Backtracking Algorithms
  • N-Queens Problem
  • Subset Sum
• Arithmetic
  • Euclidean Greatest Common Divisor (GCD)
  • Extended Euclidean GCD
  • Fast Fourier Transform (FFT) for Polynomial Multiplication

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.