Reference purposes .
- Knuth-Morris-Pratt Algorithm cpp python
- Depth First Search w/o stack cpp python
- Depth First Search with stack cpp python
- Breadth First Search cpp python
- Suffix Arrays
- Segment Trees [python] (https://github.com/robin-0/DSA/blob/patch-1/Python/SEGTREE.py)
- Segment Trees with Lazy Propogation
- Segment Trees with Max Prefix/Suffix Sum and Max Subvector sum
- Euler Totient Function cpp python
- Dijkstra's Algorithm cpp python
- Fast Modulo Multiplication / Binary Exponention cpp python
- Meet in Middle
- Binary Search cpp python
- Matrix Exponention for Fibonacci Series
- Modular Multipicative Inverse using Fermat's Theorem
- Tries
- Bellman-Ford Algorithm [python] (https://github.com/robin-0/DSA/blob/patch-3/Python/BellmanFord.py)
- Rabin-Karp Algorithm cpp python
- Binary Search Tree python
- Sieve of Eratosthenes cpp python
- [Maximum Bipartite Matching](https://github.com/saru95/DSA/blob/master/MBM.c
- Floyd-Warshall Algorithm [python] (https://github.com/robin-0/DSA/blob/patch-4/Python/FloydWarshall.py)
- Pollard Rho Integer Factorization cpp python
- Binary Indexed Trees / BIT (https://github.com/DravitLochan/DSA/blob/master/Python/BIT.py) [python]
- Square Root Decomposition
- Ford-Fulkerson Algorithm for Maximum Flow (BFS)/ Edmonds Karp Algorithm
- Miller Rabin Primality Test
- Fibonacci Numbers using fast doubling
- Generating Non-Fibonacci Numbers cpp Python
- Segmented Sieve Method of Erastothenes
- Qucik Sort cpp python
- Heap Sort cpp python
- ConvexHull(GrahamScan)cpp
- Longest Increasing Subsequence python
- Mergesort python
- Closest Pair Of Points cpp
- Radix Sort python
- Knapsack 0-1 python
- Nqueens python
- Longest Common Subsequence python