Data Structures Using C, 2nd Edition by Pearson

334 Data Structures Using C

else

Flag=0;

}

}

while (last >1);

}

}

It may be noted that the element at the root is being exchanged with the last leaf node and the rest

of the heap is being put to reheap operation. This is iteratively being done in the do-while loop till there

is only one element left in the heap.

Example 12: Write a program that in-place sorts a given list of numbers by heap sort.

Solution: We would employ the algorithm IpHeapSort() wherein the element from the root is

exchanged with the last leaf node and rest of the heap is put to reheap operation. The exchange and

reheap is carried out iteratively till ...