RIP
Tutorial
Tags
Topics
Examples
eBooks
Learning algorithm eBook (PDF)
Download this eBook for free
Chapters
Chapter 1: Getting started with algorithm
Chapter 2: A* Pathfinding
Chapter 3: A* Pathfinding Algorithm
Chapter 4: Algo:- Print a m*n matrix in square wise
Chapter 5: Algorithm Complexity
Chapter 6: Applications of Dynamic Programming
Chapter 7: Applications of Greedy technique
Chapter 8: Bellman–Ford Algorithm
Chapter 9: Big-O Notation
Chapter 10: Binary Search Trees
Chapter 11: Binary Tree traversals
Chapter 12: Breadth-First Search
Chapter 13: Bubble Sort
Chapter 14: Bucket Sort
Chapter 15: Catalan Number Algorithm
Chapter 16: Check if a tree is BST or not
Chapter 17: Check two strings are anagrams
Chapter 18: Counting Sort
Chapter 19: Cycle Sort
Chapter 20: Depth First Search
Chapter 21: Dijkstra’s Algorithm
Chapter 22: Dynamic Programming
Chapter 23: Dynamic Time Warping
Chapter 24: Edit Distance Dynamic Algorithm
Chapter 25: Equation Solving
Chapter 26: Fast Fourier Transform
Chapter 27: Floyd-Warshall Algorithm
Chapter 28: Graph
Chapter 29: Graph Traversals
Chapter 30: Greedy Algorithms
Chapter 31: Hash Functions
Chapter 32: Heap Sort
Chapter 33: Insertion Sort
Chapter 34: Integer Partition Algorithm
Chapter 35: Knapsack Problem
Chapter 36: Knuth Morris Pratt (KMP) Algorithm
Chapter 37: Kruskal's Algorithm
Chapter 38: Line Algorithm
Chapter 39: Longest Common Subsequence
Chapter 40: Longest Increasing Subsequence
Chapter 41: Lowest common ancestor of a Binary Tree
Chapter 42: Matrix Exponentiation
Chapter 43: Maximum Path Sum Algorithm
Chapter 44: Maximum Subarray Algorithm
Chapter 45: Merge Sort
Chapter 46: Multithreaded Algorithms
Chapter 47: Odd-Even Sort
Chapter 48: Online algorithms
Chapter 49: Pancake Sort
Chapter 50: Pascal's Triangle
Chapter 51: Pigeonhole Sort
Chapter 52: polynomial-time bounded algorithm for Minimum Vertex Cover
Chapter 53: Prim's Algorithm
Chapter 54: Pseudocode
Chapter 55: Quicksort
Chapter 56: Radix Sort
Chapter 57: Searching
Chapter 58: Selection Sort
Chapter 59: Shell Sort
Chapter 60: Shortest Common Supersequence Problem
Chapter 61: Sliding Window Algorithm
Chapter 62: Sorting
Chapter 63: Substring Search
Chapter 64: Travelling Salesman
Chapter 65: Trees
Download this eBook for free