-
-
Save mikezink/ef8f176e72cf73cc273783ef05e4c01f to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Python program for implementation of heap Sort | |
# To heapify subtree rooted at index i. | |
# n is size of heap | |
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 = [16, 14, 10, 8, 7, 9, 3, 2, 4, 1] | |
arr = [10, 4, 16, 8, 7, 9, 3, 2, 14, 1] | |
print("Input array is") | |
print(arr) | |
heapSort(arr) | |
n = len(arr) | |
print ("Sorted array is") | |
print(arr) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment