Question

Question NO.1 : Illustrate the operation of heapSort on the array shown below to get the following result A = \{35, 45, 61,82, 85, 101\}. A= \{45, 101, 82, 61, 35, 85\}

          Question NO.1 :
Illustrate the operation of heapSort on the array shown below to
get the following result A = \{35, 45, 61,82, 85, 101\}.
A= \{45, 101, 82, 61, 35, 85\}

Added by Shawna S.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

Step 1

- Start with the last non-leaf node, which is at index (n/2)-1 = (6/2)-1 = 2. - Compare the parent node with its children and swap if necessary to maintain the max heap property. - After the first iteration, the max heap will be: A = {35, 45, 101, 82, 85, 61} Show more…

Show all steps

Thanks for your feedback!

Question NO.1: Illustrate the operation of heapSort on the array shown below to get the following result A = {35, 45, 61, 82, 85, 101} A = {45, 101, 82, 61, 35, 85}