算法
-
编辑 删除
python实现快速排序
def quicksort(array): less = [];greater = [] if len(array) <= 1: return array pivot = array.pop() for x in array: if x <= pivot: less.append(x) else: greater.append(x) return quicksort(less) + [pivot] + quick...
