How can I implement heap sort in Python?

How can I implement heap sort in Python?

You can implement heap sort in Python by first creating a heap from the input data and then sorting it. Would you like a code example?

Yes, please provide a code example.

Here's a simple implementation of heap sort in Python:

def heapify(arr, n, i):
    largest = i  
    left = 2 * i + 1  
    right = 2 * i + 2  

    if left < n and arr[left] > arr[largest]:
        largest = left

    if right < n and arr[right] > arr[largest]:
        largest = right

    if largest != i:
        arr[i], arr[largest] = arr[largest], arr[i]  
        heapify(arr, n, largest)


def heap_sort(arr):
    n = len(arr)

    for i in range(n // 2 - 1, -1, -1):
        heapify(arr, n, i)

    for i in range(n - 1, 0, -1):
        arr[i], arr[0] = arr[0], arr[i]
        heapify(arr, i, 0)

# Example usage:
arr = [12, 11, 13, 5, 6, 7]
heap_sort(arr)
print("Sorted array is:", arr)

What is the time complexity of heap sort?

The time complexity of heap sort is O(n log n) for both the average and worst cases. It's efficient for large datasets.