#####Sorting 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 ]
1.Graph API
2.Depth first search
3.Breadth first search
1. Merge Sort (Incomplete trying inplace mergesort)
2. Karatsuba's multiplication
1. Stack
1. Queues
2. Binary Search Tree (All variants)
3. Linked Lists
4. Maps
5. Priority Queue
6. Tries
7. Bag
1. GCD
2. Sieve of Eratosthenes
3. Knuth-Morris-Pratt Algorihm(KMP)
4. Rabin-Karp Algorithm
5. Dijkstra's Algorithm(shortest Path)
6. Floyd Warshall Algorithm
7. Sparse Table(RMQ)
8. Lowest Common Ancestor
9. Modular Exponentiation
10. Counting inversion
11. Euclid's Extended Algorithm
12. Knapsack problem
13. Aho-Corasick String Matching Algorithm
14. Strongly connected Components
15. Union-Find
16. Bellman Ford Algorithm
17. Convex Hull
18. K-d tree
19. Manacher's Algorithm
20. Sweep Line Algorithm
21. Stable Marriage Problem
22. Detecting Cycles in a Graph
23. Backtracking
24. Graph Coloring
25. Johnson's Alogrithm
26. Link Cut tree
27. Burnside Lemma
28. Mo's Algorithm
29. Minimum Spanning Tree
30. FFT