Job Sequencing Problem – Greedy Algorithm – Given array of jobs where every job has deadline and associated profit if job is finished before the deadline.
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
Dijkstra’s Algorithm for Adjacency List Representation – Greedy Algorithm – We have discussed Dijkstra’s algorithm and its implementation for adjacency.In this post, O(ELogV) algorithm for adjacency list representation is discussed.
Matrix-Zigzag (or diagonal) traversal of Matrix – Matrix – Given a 2D matrix, print all elements of the given matrix in diagonal order.
Dijkstra’s shortest path algorithm – Greedy algorithm – Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning tree. Like Prim’s MST, we generate a SPT (shortest path tree) with given source as root.
Prim’s MST for Adjacency List Representation – Greedy algorithm – We have discussed Prim’s algorithm and implementation for adjacency matrix representation. The time complexity for the matrix representation is O(V^2).
Merge Sort – searching and sorting algorithm – Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves.
Prim’s Minimum Spanning Tree – Greedy Algorithm – We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like Kruskal’s algorithm, Prim’s algorithm is also a Greedy algorithm. It starts with an empty spanning tree the idea is to maintain two sets of vertices.
Insertion Sort – searching and sorting algorithm – Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands.
Efficient Huffman Coding for Sorted Input – Greedy Algorithm – Time complexity of the algorithm discussed in above post is O(nLogn). If we know that the given array is sorted (by non-decreasing order of frequency).
Bubble Sort – searching and sorting algorithm – Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements .