Question 1: Run Build-Max-Heap on the following: A=[4, 10, 16, 14, 7, 9, 3, 1, 8,...

Transcribed Image Text:

Question 1: Run Build-Max-Heap on the following: A=[4, 10, 16, 14, 7, 9, 3, 1, 8, 2] Question 2: Run HeapSort on the following: A [16, 14, 10, 8, 7, 9, 3, 2, 4, 1] Question 3: Run Max-Heap-Insert (A, 20, 6) on the following: A [15, 13, 9, 5, 12, 8] Question 4: Locate resources about Analysis of the Heapsort algorithm. Include your URLs. In your own words, briefly (half a page and single line) explain how to analyze the Heapsort algorithm. Question 1: Run Build-Max-Heap on the following: A=[4, 10, 16, 14, 7, 9, 3, 1, 8, 2] Question 2: Run HeapSort on the following: A [16, 14, 10, 8, 7, 9, 3, 2, 4, 1] Question 3: Run Max-Heap-Insert (A, 20, 6) on the following: A [15, 13, 9, 5, 12, 8] Question 4: Locate resources about Analysis of the Heapsort algorithm. Include your URLs. In your own words, briefly (half a page and single line) explain how to analyze the Heapsort algorithm.

Answer rating: 100% (QA)

Question 1 To run BuildMaxHeap on the given array A4 10 16 14 7 9 3 1 8 2 we start from the last non... View the full answer