Algorithms Notes for Professionals


Chapters

  1. Getting started with algorithms
  2. Algorithm Complexity
  3. Big-O Notation
  4. Trees
  5. Binary Search Trees
  6. Check if a tree is BST or not
  7. Binary Tree traversals
  8. Lowest common ancestor of a Binary Tree
  9. Graph
  10. Graph Traversals
  11. Dijkstra’s Algorithm
  12. A* Pathfinding
  13. A* Pathfinding Algorithm
  14. Dynamic Programming
  15. Applications of Dynamic Programming
  16. Kruskal’s Algorithm
  17. Greedy Algorithms
  18. Applications of Greedy technique
  19. Prim’s Algorithm
  20. Bellman–Ford Algorithm
  21. Line Algorithm
  22. Floyd-Warshall Algorithm
  23. Catalan Number Algorithm
  24. Multithreaded Algorithms
  25. Knuth Morris Pratt (KMP) Algorithm
  26. Edit Distance Dynamic Algorithm
  1. Online algorithms
  2. Sorting
  3. Bubble Sort
  4. Merge Sort
  5. Insertion Sort
  6. Bucket Sort
  7. Quicksort
  8. Counting Sort
  9. Heap Sort
  10. Cycle Sort
  11. Odd-Even Sort
  12. Selection Sort
  13. Searching
  14. Substring Search
  15. Breadth-First Search
  16. Depth First Search
  17. Hash Functions
  18. Travelling Salesman
  19. Knapsack Problem
  20. Equation Solving
  21. Longest Common Subsequence
  22. Longest Increasing Subsequence
  23. Check two strings are anagrams
  24. Pascal’s Triangle
  25. Algo:- Print a m*n matrix in square wise
  26. Matrix Exponentiation
  27. polynomial-time bounded algorithm for Minimum Vertex Cover
  28. Dynamic Time Warping
  29. Fast Fourier Transform
  30. Pseudocode

Credits
Thank you greatly to all the people from Stack Overflow Documentation who helped provide this content, more changes can be sent to web@petercv.com for new content to be published or updated. (See page 250 to watch all creedit over PDF file, please).


Source: goalkicker.com/AlgorithmsBook

Click to rate this post
[Total: 0 Average: 0]