Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it. Brian W. Kernighan

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.

Output

          	        
          	        

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

          	        
          	        				    


Comments



Please login to add comments.