There are two ways of constructing a software design: One way is to make it so simple that there are obviously no deficiencies, and the other way is to make it so complicated that there are no obvious deficiencies. The first method is far more difficult. C.A.R. Hoare

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.

Output

          	        
          	        

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]

          	        
          	        				    


Comments



Please login to add comments.