Sorting Heaps

Computer Science Level pending
1
A = { 6 , 2 , 1 , 0 }

Consider the max heap above. After the end of the first iteration of the loop that takes place in executing Heap Sort, the array for of the max heap will take the form of :

1
A = {a , b , c , d }

Where \(a\), \(b\), \(c\) and \(d\) are positive integers. Input \(1000a+100b+10c+d \) as the answer.

×

Problem Loading...

Note Loading...

Set Loading...