Python学习笔记:几种奇妙的排序算法
def bubble_sort(lst):
n = len(lst)
for y in range(n-1, 0, -1):
for x in range(y):
if lst[x] > lst[x+1]:
lst[x], lst[x+1] = lst[x+1], lst[x]
return lst
def quick_sort(lst):
if len(lst) <= 1:
return lst
p = lst[0]
left = []
right = []
for x in lst[1:]:
if x < p:
left.append(x)
else:
right.append(x)
return quick_sort(left) + [p] + quick_sort(right)