Question

Write the heapSort(numList) function that takes a maxHeep object and sorts it. Input is maxHeap type.

heapSort(numList) is a function outside the maxHeap class.

Expected output:

>>> heapSort([9,7,4,1,2,4,8,7,0,-1])
[-1, 0, 1, 2, 4, 4, 7, 7, 8, 9]

Answer 1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

Note: Brother sometimes while uploading on HomeworkLib the indentations change. So, I request you to verify it with screenshot once.

def heapify(arr, n, i):
largest = i # Initialize largest as root
l = 2 * i + 1 # left = 2*i + 1
r = 2 * i + 2 # right = 2*i + 2
  
# See if left child of root exists and is
# greater than root
if l < n and arr[i] < arr[l]:
largest = l
  
# See if right child of root exists and is
# greater than root
if r < n and arr[largest] < arr[r]:
largest = r
  
# Change root, if needed
if largest != i:
arr[i],arr[largest] = arr[largest],arr[i] # swap
  
# Heapify the root.
heapify(arr, n, largest)
  
# The main function to sort an array of given size
def heapSort(arr):
n = len(arr)
  
# Build a maxheap.
for i in range(n, -1, -1):
heapify(arr, n, i)
  
# One by one extract elements
for i in range(n-1, 0, -1):
arr[i], arr[0] = arr[0], arr[i] # swap
heapify(arr, i, 0)
  
# Driver code to test above
arr = [9,7,4,1,2,4,8,7,0,-1]
heapSort(arr)
n = len(arr)
print ("Sorted array is")
for i in range(n):
print ("%d" %arr[i],end=' '),

Kindly revert for any queries

Thanks.