heapsort

# -*- coding: utf-8 -*-
"""
Created on Mon Nov 26 07:59:21 2018

@author: kowamich
"""

A=[]
from random import randint
for i in range(0,100):
    j=randint(1,100)
    A.append(j)
print(A)

print()

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

    if(left<n and A[i]<A[left]):
        largest = left

    if(right<n and A[largest]<A[right]):
        largest = right

    if(largest != i):
        A[i],A[largest] = A[largest],A[i]

        heapify(A,n, largest)

def heapsort(A):
    n = len(A)

    #budowanie kopca maksymalnego
    for i in range(n,-1,-1):
        heapify(A,n,i)

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

        heapify(A,i,0)

heapsort(A)
print(A)