2016年4月17日
Division and Recursion-HeapSort
from functools import reducedef swap(a, i, j): t = a[i] a[i]=a[j] a[j]=t def heapify_sub_tree1(a,i,size): minimum = i j = 2*i if (j<=size and a[j] < a Read More
posted @ 2016-04-17 15:30 zhaodonglin Views(108) Comments(0) Diggs(0)