QuickSort
QuickSort - Searching and Sorting - Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as...
Heap Sort
Heap Sort - Searching and Sorting - Heap sort is a comparison based sorting technique based on Binary Heap data structure....
Minimum Number of Platforms Required for a Railway/Bus Station
Minimum No of Platforms Required for a Railway/Bus Station - Greedy algorithm - Given arrival and departure times of all...
K Centers Problem
K Centers Problem - Greedy Algorithm - Given n cities and distances between every pair of cities, select k cities to place...
Greedy Algorithm to find Minimum number of Coins
Greedy Algorithm to find Minimum number of Coins - Greedy Algorithm - Given a value V, if we want to make change for V Rs....
C Algorithm – Introduction for Linked List | Set 1
C Algorithm - Introduction for Linked List | Set 1 - Linked List - Like arrays, Linked List is a linear data structure....
Job Sequencing Problem
Job Sequencing Problem - Greedy Algorithm - Given array of jobs where every job has deadline and associated profit if job is...
Dijkstra’s Algorithm for Adjacency List Representation
Dijkstra’s Algorithm for Adjacency List Representation - Greedy Algorithm - We have discussed Dijkstra’s algorithm and its...
Matrix-Zigzag (or diagonal) traversal of Matrix
Matrix-Zigzag (or diagonal) traversal of Matrix - Matrix - Given a 2D matrix, print all elements of the given matrix in...
Dijkstra’s shortest path algorithm
Dijkstra’s shortest path algorithm - Greedy algorithm - Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum...
