Created
February 20, 2018 00:10
-
-
Save MinaGabriel/19fb603a4ac82999839ba01388cf1e8e 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
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 | |
print(arr,"largest: " + str(largest), "i: " + str(i), "l: " + str(l), "r: " + str(r), h) | |
# 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. | |
print(largest) | |
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 = [12, 11, 13, 5, 6, 7] | |
heapSort(arr) | |
n = len(arr) | |
print ("Sorted array is") | |
for i in range(n): | |
print ("%d" % arr[i]), | |
# This code is contributed by Mohit Kumra |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment