chapter06文件io堆排序實現(xiàn)要求嚴格對齊就像一棵二叉樹一樣

102*7+12*前空格數(shù)234length=length=len(array)index=1因為使用時前面補0了，不然應該是depth=math.ceil(math.log2(length))#4#print(depth)space=''*foriinrange(depth-1,-1,-1):pre=2**i-1print(pre*spaceend=''offset=2**(depth-i-line=array[index:index+offset]#取數(shù)字interval2*pre1*space間隔的空格print(interval.join(map(str,line)))index+=print_tree([0,30,20,80,40,50,10,60,70,90,print_tree([0,30,20,80,40,50,10,60,70,90,22,33,44,55,66,print_tree([0,30,20,80,40,50,10,60,70,90,22,33,44,55,66,77,88,99,##Heap#為了和編碼對應，增加一個無用的0#origin=[0,50,10,90,30,70,40,80,60,origin=[0,30,20,80,40,50,10,60,70,totallen(origin1初始待排序元素個數(shù)，即ndefheap_adjust(n,i,array: :paramn::parami::paramarray:while2*i<=lchile_index=2*i max_child_index=lchile_index#ifnlchile_indexandarray[lchile_index1array[lchile_index]:n>2imax_child_index=lchile_index+1##ifarray[max_child_index]>array[i],array[max_child_index]=array[max_child_index],iimax_child_indexelse:##heap_adjust(total,total//2,origin)##defforiinrange(total//2,0,-1):return20 202020whiletotal>1:array[1],array[total]=array[total],array[1]#total-=returnarraywhiletotal>1:array[1],array[total]=array[total],array[1]#total-=iftotal==2andarray[total]>=array[total-1]:returnarrayimportdefprint_tree(array,unit_width=2):i102*7+12*前空格數(shù)234length=len(array)index=1#因為使用時前面補0了，不然應該是depth=math.ceil(math.log2(length))#4#print(depth)space=''*foriinrange(depth-1,-1,-1):pre=2**i-1print(pre*spaceendoffset=2**(depth-i-line=array[index:index+offset]#取數(shù)字interval2*pre1*space間隔的空格print(interval.join(map(str,line)))index+=#Heap#為了和編碼對應，增加一個無用的0#origin=[0,50,10,90,30,70,40,80,60,origin=[0,30,20,80,40,50,10,60,70,totallen(origin1#初始待排序元素個數(shù)，即nprint("="*50)defheap_adjust(n,i,array:list)::paramn::parami::paramarray:while2*i<=lchile_index=2*imax_child_index=lchile_index#ifnlchile_indexandarray[lchile_index1array[lchile_index]:#n>2imax_child_index=lchile_index+1# ifarray[max_child_index]>i=max_child_index#被交換后，需要判斷是否還需要調(diào)整##defmax_heap(total,array:foriinrange(total//2,0,-1):heap_adjust(total,i,array)returnprint_tree(max_heap(total,origin))print("="*50)defsort(total,array:list):whiletotal>1:array[1array[to