追逐梦想...

# 二分查找 O(㏒2n)class BinarySearch: @staticmethod def rank(key, a): lo, hi = 0, len(a)+1 while lo <= hi: mid = lo + (hi - lo) // 2 if key < a[mid]:...

# 选择排序 O(n²)class Selection: @staticmethod def sort(a): length = len(a) for i in range(length): min_idx = i for j in range(i+1, length, 1): ...

# 插入排序class Insertion: @staticmethod def sort(a): length = len(a) i = 1 while i < length: j = i while j > 0 and a[j] < a[j-1]: ...