Let us change our traditional attitude to the construction of programs. Instead of imagining that our main task is to instruct a computer what to to, let us concentrate rather on explaining to human beings what we want a computer to do. Donald Knuth

Min-heap priority queue

Language Java | Level Intermediate | Category Algorithms | August 3, 2015 8:13 am

Algorithm Problem Description

Priority queue insert smallest key value is at the front of the queue (Min heap). Write a program to implement min heap priority queue.



List of items from array (Before sorting): [34, 56, 23, 88, 67, 89]
List of items from Heap after sorting): [23,34,56,67,88,89]



Please login to add comments.