aspace123的博客

data = [3,5,2,90,33,1,25,32,44,12,55,24,1]# 调整堆的函数，从底往上调整，每次调整一组父子节点位置def convert(l, i, n):    j = 2*i + 1    while j<n:        if j+1<n and l[j] < l[j+1]: # 判断i为父节点时，子节点j和j+1的情况      ...

data = [45,3,2,6,3,78,5,44,22,65,46]# 合并函数，将相邻的两个区间合并为一个def merge(a, b): result = [] i = j = 0 while i<len(a) and j<len(b): if a[i] < b[j]: result.append(a[...

data = [45,3,2,6,3,78,5,44,22,65,46]def quickSort(data, start, end): i = start j = end # i与j重合时，一次排序结束 if i >= j: return # 设置最左边的数为基准值 flag = data[start] while...