14 Important Algorithms for programmer
1) Binary Search
Checks each array element for the target value until a match is found!!
2) Breadth First Search (BFS)
Explores the neighbor nodes (graph) before moving to the next-level ones
3) Depth First Search (DFS)
Explores nodes as far as possible along each branch before backtracking
4) In, Pre, Postorder Tree Traversals
Iterative and Recursive solutions to traverse the tree data structure
5) Insertion, Selection, Merge, Quick, Counting, Heap Sort
These algorithms effectively sort given array using different techniques
6) Kruskal’s Algorithm
Constructs a minimum spanning tree out of a connected, weight graph.
7) Floyd Warshall Algorithm
Returns the shortest paths b/w every pair of vertices in the graph.
8) Dijkstra’s Algorithm
It is an algorithm for finding the shortest paths b/w nodes in a graph.
9) Bellman Ford Algorithm
Unlike Dijkstra’s Algorithm, it can handle the edges of the negative weight in the graph
10) Kadane’s Algorithm
Finds a contiguous subarray within an array that has the largest sum
11) Lee Algorithm
It is one possible solution for maze routing problems
12) Flood Fill Algorithm
Determines the area connected to a given node in a multi-dimensional array
13) Topological Sorting in a Directed Acyclic Graph
Is a linear ordering of vertices of a directed graph that is for Directed Acyclic Graph(DAG)
14) Union Find Algorithm
Works with a disjoint-set data structure to perform some operation