# Code: import random class Sorts: def heapSort(self, array): Sorts the given array using the heapSort algorithm.

Fantastic news! We've Found the answer you've been seeking!

## Question:

Code:

import random

class Sorts:

def heapSort(self, array):

"""

Sorts the given array using the heapSort algorithm.

Args:

array: The array to sort.

Returns:

The sorted array.

"""

# Build the heap.

for i in range(len(array) // 2, -1, -1):

self.heapify(array, i)

# Heap sort the array.

for i in range(len(array) - 1, 0, -1):

array[0], array[i] = array[i], array[0]

self.heapify(array, 0)

Error Messages:

**Related Book For**

## Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest