Good code is its own best documentation. As you're about to add a comment, ask yourself, 'How can I improve the code so that this comment isn't needed?' Improve the code and then document it to make it even clearer. Steve McConnell

Priority queue

Language Java | Level Intermediate | Category Algorithms | August 2, 2015 9:05 pm

Algorithm Problem Description

The priority queue is a data structure with each element has a priority associated with it. The high priority element served before low priority element.

Priority queues provide extra flexibility over sorting mechanism. Write a program to implement the priority queue.



Unsorted array before sorting from Array: [12, 34, 56, 23, 45, 78, 46]
Unsorted array before sorting from Heap: 78 45 56 12 23 34 46 
Sorted array after sorting from Priority Queue: 78 56 46 45 34 23 12



Please login to add comments.