排序算法:
def bubble_sort(seq):
# 冒泡排序
count = len(seq)
for i in range(0, count):
for j in range(i + 1, count):
if seq[i] > seq[j]:
seq[i], seq[j] = lists[j], lists[i]
return lists
def qsort(seq):
if seq==[]:
return []
else:
pivot=seq[0]
lesser=qsort([x for x in seq[1:] if x<pivot])
greater=qsort([x for x in seq[1:] if x>=pivot])
return lesser+[pivot]+greater