About
Chapter 1: Getting started with algorithms
Chapter 2: Algorithm Complexity
Chapter 3: Graph
Chapter 4: Graph Traversals
Chapter 5: Dijkstra?s Algorithm
Chapter 6: A* Pathfinding
Chapter 7: A* Pathfinding Algorithm
Chapter 8: Dynamic Programming
Chapter 9: Kruskals Algorithm
Chapter 10: Greedy Algorithms
Chapter 11: Applications of Greedy technique
Chapter 12: Prims Algorithm
Chapter 13: Bellman?Ford Algorithm
Chapter 14: Line Algorithm
Chapter 15: Floyd-Warshall Algorithm
Chapter 16: Catalan Number Algorithm
Chapter 17: Multithreaded Algorithms
Chapter 18: Knuth Morris Pratt (KMP) Algorithm
Chapter 19: Edit Distance Dynamic Algorithm
Chapter 20: Online algorithms
Chapter 21: Big-O Notation
Chapter 22: Sorting
Chapter 23: Bubble Sort
Chapter 24: Merge Sort
Chapter 25: Insertion Sort
Chapter 26: Bucket Sort
Chapter 27: Quicksort
Chapter 28: Counting Sort
Chapter 29: Heap Sort
Chapter 30: Cycle Sort
Chapter 31: Odd-Even Sort
Chapter 32: Selection Sort
Chapter 33: Trees
Chapter 34: Binary Search Trees
Chapter 35: Check if a tree is BST or not
Chapter 36: Binary Tree traversals
Chapter 37: Lowest common ancestor of a Binary Tree
Chapter 38: Searching
Chapter 39: Substring Search
Chapter 40: Breadth-First Search
Chapter 41: Depth First Search
Chapter 42: Hash Functions
Chapter 43: Travelling Salesman
Chapter 44: Knapsack Problem
Chapter 45: Equation Solving
Chapter 46: Longest Common Subsequence
Chapter 47: Longest Increasing Subsequence
Chapter 48: Check two strings are anagrams
Chapter 49: Pascals Triangle
Chapter 50: Algo:- Print a m*n matrix in square wise
Chapter 51: Matrix Exponentiation
Chapter 52: Applications of Dynamic Programming
Chapter 53: polynomial-time bounded algorithm for Minimum Vertex Cover
Chapter 54: Dynamic Time Warping
Chapter 55: Fast Fourier Transform
Appendix A: Pseudocode
Credits
You may also like

*The digital edition does not include access codes to additional material or programs mentioned in the book.