Graph algorithms

1. Breadth First Search (BFS)
2. Depth First Search (DFS)
3. Topological Sort
4. Johnson's algorithm
5. Bridges in a graph
6. Minimum Spanning tree Prim
7. Minimum Spanning tree Kruskal
8. Articulation Points (or Cut Vertices) in a Graph
9. Shortest Path from source to all vertices Dikstra
10. Shortest Path from every vertex to every other vertex Floyd Warshall.

Dynamic Programming

1. Longest Common Subsequence
2. Longest Increasing Subsequence
3. Edit Distance
4. Minimum Partition
5. Ways to Cover a Distance
6. Longest Path In Matrix
7. Subset Sum Problem
8. Optimal Strategy for a Game
9. O-1 Knapsack Problem
10. Assembly Line Scheduling

Searching & Sorting

1. Binary Search
2. Quick Sort
3. Merge Sort
4. Order Statistics
5. KMP algorithm
6. Rabin karp
7. Z's algorithm
8. Aho Corasick String Matching
9. Counting Sort
10. Manachers algorithm

Prime Numbers and Prime Factorization

1. Sieve of Eratosthenes
2. Segmented Sieve
3. Wilson's Theorem
4. Prime Factorization
5. Pollard's ho algorithm

Modulo Arithmetic Algorithms

1. Basic and Extended Euclidean algorithms
2. Euler' Totient Function
3. Modular Exponentiation
4. Modular Multiplicative Inverse
5. Chinese remainder theorem Introduction
6. Chinese remainder theorem &
7. Modulo Inverse Implementation

Geometrical and Network Flow Algorithms##

1. Convex Hull
2. Graham Scan
3. Line Intersection
4. Interval Tree
5. Matrix Exponentiation and this
6. Maxflow Ford Furkerson Algo
7. Edmond Karp Implementation
8. Stable Marriage Problem
9. Hopcroft-Karp Algorithm for Maximum 10.Matching