KathyLJQ的博客

def Heapify(li, i, size): left = 2*i+1 right = 2*i+2 maxi = i if left < size and li[left] > li[maxi]: maxi = left if right < size and li[right] > li[maxi]: maxi = right if maxi == i: return i.

from timeit import Timer def back_sort(lis): n= len(lis) if n == 1: return (lis) mid = n//2 left_sorted = back_sort(lis[:mid]) right_sorted = back_sort(lis[mid:]) n_le...