# python3 version import random, time def makelist(m,n): al=[] for x in range(n): al.append(random.randint(1,m)) return al def downheap(h,i): n=len(h) v=h[i] while i<n//2: ix=i+i+1 if ix<n-1 and h[ix]<h[ix+1]: ix=ix+1 if v>h[ix]: break h[i]=h[ix] i=ix h[i]=v def downheapOne(h,n): i=0 v=h[i] while i<n//2: ix=i+i+1 if ix<n-1 and h[ix]<h[ix+1]: ix=ix+1 if v&g..