摘要:
def quick_sort(alist, first, last): if first >= last: # 如果开始等于结尾,即就一个元素 return mid_value = alist[first] low = first high = last # 对于相等的情况都放到low的位置,所以第 阅读全文
摘要:
```
from timeit import Timer def t1(): li = [] for i in range(10000): li.append(i) def t2(): li = [] for i in range(10000): li += [i] def t3(): li = [i for i ... 阅读全文