Complete the following heapsort function } template void HeapSort(ItemType values, int numValues) { int index; //...

 

Transcribed Image Text:

Complete the following heapsort function } template<class ItemType> void HeapSort(ItemType values, int numValues) { int index; // Convert the array of values into a heap. for (index numValues/2 - 1; index >= 0; index--) ReheapDown (values, index, numValues-1); // Sort the array. for (1. { Swap (values [0], values [index]); ReheapDown (values, 0, index-1); Complete the following heapsort function } template<class ItemType> void HeapSort(ItemType values, int numValues) { int index; // Convert the array of values into a heap. for (index numValues/2 - 1; index >= 0; index--) ReheapDown (values, index, numValues-1); // Sort the array. for (1. { Swap (values [0], values [index]); ReheapDown (values, 0, index-1);

Answer rating: 100% (QA)

Detailed Explanation To complete the HeapSort function lets fill in the missing parts Heres the comp... View the full answer