python实现排序算法

#冒泡排序
def bubble_sort(list):
l = len(list)
for i in range(l-1,0,-1):
for j in range(i):
if list[j] > list[j+1]:
list[j],list[j+1] = list[j+1],list[j]
return list
#选择排序
def select_sort(list):
length = len(list)
for i in range(length):
min = i
for j in range(i,length):
if list[j] < list[min]:
min = j
list[i],list[min] = list[min],list[i]
return list
#快速排序
def quick_sort(list):
if list == []:
return []
else:
first = list[0]
left = quick_sort([l for l in list[1:]if l < first])
right = quick_sort([l for l in list[1:] if l > first])
return left +[first] + right