Top 25 important algorithms
This folder contains all the below mentioned algorithms. These are considered as very important algorithms. You can see them in the file with name seqNum.cpp
- Binary Search ** O(Log N)
- Breadth First Search ** O(N)
- Depth First Search ** O(N)
- Merge Sort ** O(N log N)
- Quick Sort ** O(N log N)
- Kruskal's Algorithm ** O(E log V + V log E)
- Dijkstra's Algorithm
- Floyd Warshal's Algorithm
- Bellman Ford
- Kadane's Algorithm ** O(N)
- Lee Algorithm ** O(N)
- Flood Fill Algorithm ** O(N)
- Floyd Cycle detection ** O(N)
- Union Find Algorithm ** O(V+E)
- Topological Sort ** O(V+E)
- KMP Algorithm
- Insertion Sort ** O(N log N)
- Selection Sort ** O(N log N)
- Counting Sort ** O(N)
- Heap Sort
- Kahn's Topological Sort ** O(V+E)
- Huffman's Coding Compression ** O(NlogN)
- Quick Select Algorithm ** O(N) better average time.
- Boyer Moore Majority Voting Algo
- Euclid's Algorithm ** O(Log N)
- Detect a cycle in graph **
- Rabin knarp
Please mail me @ sherlockdetective69@gmail.com if you find any mistake in these algorithms.