Graph Data Structure Spanning Tree Strongly Connected Components Adjacency Matrix Adjacency List DFS Algorithm Breadth-first Search Bellman Ford's Algorithm Sorting and Searching Algorithms Bubble Sort Selection Sort Insertion Sort Merge Sort Quicksort Counting Sort Radix Sort Bucket Sort Heap Sort Shell So...
Heap is used while implementing a priority queue. Dijkstra's Algorithm Heap Sort
Heap Sort Algorithm Heap Sort is a popular and efficientsorting algorithmin computer programming. Learning how to write the heap sort algorithm requires knowledge of two types of data structures - arrays and trees. The initial set of numbers that we want to sort is stored in an array e.g.[...