Array A is not a heap. Clearly explain why does above tree not a heap? b) Using build heap procedure discussed in the class, con
struct the heap data structure from the array A above. Represent your heap in the array A as well as using a binary tree. Clearly show all the steps c) Show how heap sort work in the heap you have constructed in part (b) above. Clearly show all the step in the heap sort
1 answer:
You might be interested in
Using the knowledge of pseudocodes it will be possible to write a code that calculates the amount of hours worked and giving warnings about it.
<h3>Writing a pseudocode we have that:</h3><em>while </em>
<em>if number == 0</em>
<em>break</em>
<em>hours =0 </em>
<em>for i =1 to 5 </em>
<em>hours = hours + time_out[ i ] - time_in[ i ]</em>
<em> If hours >36 : </em>
<em>print ( "Name is " ,name)</em>
<em>print( "No of hours are ",hours)</em>
<em>print("Congratulaion! Your working hours are more than 36")</em>
<em>If hours <30 : #</em>
<em>print ( "Name is " ,name)</em>
<em>print( "No of hours are ",hours)</em>
<em>print("Warning !!!")</em>
<em>End loop</em>
See more about pseudocode at brainly.com/question/13208346
#SPJ1
