1. Bubble Sort [_Execution_ _time_ : 199.22 seconds ]
2. Selection Sort [_Execution_ _time_ : 75.192 seconds ]
3. Insertion Sort [_Execution_ _time_ : 52.833 seconds ]
4. Shell Sort [_Execution_ _time_ : 15.703 seconds ]
5. Merge Sort [_Execution_ _time_ : 0.86 seconds ]
6. Quick Sort (without shuffling) [_Execution_ _time_ : 0.817 seconds ]
7. Count Sort [_Execution_ _time_ : 0.645 seconds ]
- Graph API
- Depth first search
- Breadth first search
- Dijkstra's Algorithm
- Floyd-Warshall's Algorithm
- Merge Sort (Incomplete trying inplace mergesort) | READ
-
GCD | wiki | Euclidean Algorithm | Extended Euclidean
-
Karatsuba's multiplication
- Queues
- Binary Search Tree (All variants)
- Linked Lists
- Maps
- Priority Queue
Tries- Bag
- Segment Tree
Fenwick Tree- HLD on Trees
- VisuAlgo
- HackerRank
- Codeforces
- CodeChef
- TopCoder
- e-maxx - for Russian readers
- e-maxx - for English readers
- []
- Knuth-Morris-Pratt Algorihm(KMP) | Wiki | Tutorial | Example
- Rabin-Karp Algorithm | Wiki | Tutorial | Example
- Dijkstra's Algorithm(shortest Path) | Wiki | Tutorial
- Floyd Warshall Algorithm
- Sparse Table(RMQ)
- Lowest Common Ancestor
- Modular Exponentiation
- Counting inversion
- Euclid's Extended Algorithm
- Knapsack problem
- Aho-Corasick String Matching Algorithm
- Strongly connected Components
- Union-Find
- Bellman Ford Algorithm
- Convex Hull
- K-d tree
- Manacher's Algorithm
- Sweep Line Algorithm
- Stable Marriage Problem
- Detecting Cycles in a Graph
- Backtracking
- Graph Coloring
- Johnson's Alogrithm
- Link Cut tree
- Burnside Lemma
- Mo's Algorithm
- Minimum Spanning Tree
- FFT
- Towers of hanoi
- Heacy Light Decomposition
- Suffix Tree Automation(Pattern Searching)
- Binary Indexed Tree
- Z Algorithm
- Line Intersection Algorithm
- Topological Sorting
- Binary Search
- Hash Function
- Segment Trees(Lazy Propagation)
- Vertex Cover Problem
- Interval Tree
- Hungarian Algorithm
- Matrix Exponentiation
- Gaussian Elimination
- Pollard Rho Integer Factorisation
- Eulerian and Hamiltonian Path
- Blossom/Edmond's Algorithm