Algorithms Book
What is Algorithm ..?
So exactly what is an algorithm? It is a sequence of steps to solve any difficulty. Say, you have a debt of $10000. How can you manage to clean all the debt? You manage your own time, you save money, increase your working hours, you work more difficult and lots of such actions.
You’re here after a pattern to solve a issue linearly using a succession of steps. So you are in fact following an algorithm.
Chapters
- Chapter 1 :- Getting started with algorithms
- Chapter 2 :- Algorithm Complexity
- Chapter 3 :- Big-O Notation
- Chapter 4 :- Trees
- Chapter 5 :- Binary Search Trees
- Chapter 6 :- Check if a tree is BST or not
- Chapter 7 :- Binary Tree traversals
- Chapter 8 :- Lowest common ancestor of a Binary Tree
- Chapter 9 :- Graph
- Chapter 10 :- Graph Traversals
- Chapter 11 :- Dijkstra’s Algorithm
- Chapter 12 :- A* Pathfinding
- Chapter 13 :- Dynamic Programming
- Chapter 14 :- Applications of Dynamic Programming
- Chapter 15 :- Kruskal’s Algorithm
- Chapter 16 :- Greedy Algorithm
- Chapter 17 :- Applications of Greedy technique
- Chapter 18 :- Prim’s Algorithm
- Chapter 19 :- Bellman–Ford Algorithm
- Chapter 20 :- Line Algorithm
- Chapter 21 :- Floyd-Warshall Algorithm
- Chapter 22 :- Catalan Number Algorithm
- Chapter 23 :- Multithreaded Algorithms
- Chapter 24 :- Knuth Morris Pratt (KMP) Algorithm
- Chapter 25 :- Edit Distance Dynamic Algorithm
- Chapter 26 :- Online algorithms
- Chapter 27 :- Sorting
- Chapter 28 :- Bubble Sort
- Chapter 29 :- Merge Sort
- Chapter 28 :- Insertion Sort
- Chapter 29 :- Bucket Sort
- Chapter 30 :- Quicksort
- Chapter 31 :- Counting Sort
- Chapter 32 :- Heap Sort
- Chapter 33 :- Cycle Sort
- Chapter 34 :- Odd-Even Sort
- Chapter 35 :- Selection Sort
- Chapter 36 :- Searching
- Chapter 37 :- Breadth-First Search
- Chapter 38 :- Depth First Search
- Chapter 39 :-Hash Functions
- Chapter 40 :- Travelling Salesman