In the heap sort implementation, once the heap has been created, we exchange the element at the top of the heap with the last element in the heap and adjust the heap size ____.
A. up by 1
B. down by 1
C. up by 2
D. down by 2
Answer: B
Computer Science & Information Technology
You might also like to view...
How did the management pyramid influence your decisions?
What will be an ideal response?
Computer Science & Information Technology
Why should a threads package be interested in the events of a thread’s becoming blocked or unblocked? Why should it be interested in the event of a virtual processor’s impending preemption? (Hint: other virtual processors may continue to be allocated.)
What will be an ideal response?
Computer Science & Information Technology