khokho/procookbook

All the Famous algorithms you need!

List of Algorithms

#####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 ]

Graph

1. Graph API
2. Depth first search
3. Breadth first search

Not Catagorized

1. Merge Sort (Incomplete trying inplace mergesort)
2. Karatsuba's multiplication

Data Structures

1. Stack

Wish List

Data Structures

1. Queues
2. Binary Search Tree (All variants)
3. Linked Lists
4. Maps
5. Priority Queue
6. Tries
7. Bag
8. Segment Tree
9. Fenwick Tree

Resources

Useful Sites

• HackerRank
• Codeforces
• CodeChef
• TopCoder
• e-maxx - for Russian readers

Algorithms

1. GCD - The Euclidean Algorithm - The Extended Euclidean Algorithm
2. Sieve of Eratosthenes - Sieve of Eratosthenes - Examples
3. Knuth-Morris-Pratt Algorihm(KMP) - Knuth–Morris–Pratt algorithm - Example
4. Rabin-Karp Algorithm - Rabin-Karp and Knuth-Morris-Pratt Algorithms - Example
5. Dijkstra's Algorithm(shortest Path) - Dijkstra (Heap method)
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
31. Towers of hanoi
32. Heacy Light Decomposition
33. Suffix Tree Automation(Pattern Searching)
34. Binary Indexed Tree
35. Z Algorithm
36. Line Intersection Algorithm
37. Topological Sorting
38. Binary Search
39. Hash Function
40. Segment Trees(Lazy Propagation)
41. Vertex Cover Problem
42. Interval Tree
43. Hungarian Algorithm
44. Matrix Exponentiation
45. Gaussian Elimination
46. Pollard Rho Integer Factorisation
47. Eulerian and Hamiltonian Path
48. Blossom/Edmond's Algorithm