Ask your own question, for FREE!
Computer Science 10 Online
OpenStudy (anonymous):

Python.

OpenStudy (anonymous):

The min-heapify code, which I've written, is not working and I am unable to find out the mistake. Help, someone? :) def heapify(l): r=range(len(l)) r=r[::-1] a=0 for i in r: if l[i/2]<l[i] and l[i/2]<l[i-1]: return l elif l[i/2]>l[i]: l[i]=a l[i]=l[i/2] l[i/2]=a heapify(l[i]) return l else: l[i-1]=a l[i-1]=l[i/2] l[i/2]=a heapify(l[i-1]) return l return l l=[4,7,29,10,3,6] print heapify(l)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!