from time import clock from time import clock import sys def parent(i): return i/2 def left(i): return 2*i def right(i): return 2*i+1 def Build_Heap(a): global size length=len(a) compare=0 swapp=0 for i in range(int(length/2),0,-1): comparision,swap= Min_Heapify(a,i,length) compare=compare+comparision swapp=swapp+swap size=size+sys.getsizeof(length)+sys.getsizeof(compare)+sys.getsizeof(swapp)+sys.getsizeof(a) return compare,swapp def Min_Heapify(a,i,length): global size l=left(i) r=right(i) comparision=0 swap=0 if l<=length and a[l-1]