Homework answers / question archive / Describe a vector of distinct elements with size n = 32 such that it is a max-heap and, if it is the initial result of running heapify, no other heap created from the input will cause the algorithm to use more comparisons to complete the sorting stage of HeapSort

Describe a vector of distinct elements with size n = 32 such that it is a max-heap and, if it is the initial result of running heapify, no other heap created from the input will cause the algorithm to use more comparisons to complete the sorting stage of HeapSort

Computer Science

Share With

Describe a vector of distinct elements with size n = 32 such that it is a max-heap and, if it is the initial result of running heapify, no other heap created from the input will cause the algorithm to use more comparisons to complete the sorting stage of HeapSort. Explain why it does this. You do not (and should not) write out the entire array5 but rather describe the order.