Heap and Heap Sort Your application will have a huge number of find the maximum operations, but a relatively small number of insert and remove the maximum operations. Which priority- queue...

Heap and Heap Sort

1. Your application will have a huge number of find the maximum operations, but a relatively small number of insert and remove the maximum operations. Which priority- queue implementation do you think would be most effective: heap, unordered array, or ordered array? please Explain your Answer.


2. Show in the style given in the class, how the number 82403 will be sorted using heap-sort (min-heap).