heapsort

class heap:
    def __init__(self,A):
        self.A=A
        self.size=0
        self.length=len(A)-1
    def __setitem__(self,i,x):
        self.A[i]=x
    def __getitem__(self,i):
        return self.A[i]
    def __repr__(self):
        return ' '.join([str(i) for i in self.A])
def Parent(i):
    return i//2
def Left(i):
    return 2*i
def Right(i):
    return 2*i+1
def max_heapify(A,i):
    l=Left(i)
    r=Right(i)
    if l<=A.size and A[l]>A[i]:
        largest=l
    else: largest=i
    if r<=A.size and A[r]>A[largest]:
        largest=r
    if largest!=i:
        A[largest],A[i]=A[i],A[largest]
        max_heapify(A,largest)
def build_max_heap(A):
    A.size=A.length
    for i in range(A.length//2,0,-1):
        max_heapify(A,i)
def heap_sort(A):
    build_max_heap(A)
    for i in range(A.length,1,-1):
        A[i],A[1]=A[1],A[i]
        A.size-=1
        max_heapify(A,1)
lst=['error',1,3,2,16,9,10,14,8,7]
h=heap(lst)
print(h.size)
print(h.length)
heap_sort(h)
print(h)