冒泡排序
交换过程图示(第一次):
def bubble_sort(alist):
n = len(alist)
for j in range(0,n-1):
count = 0
for i in range(0,n-1-j):
if alist[i] > alist[i+1]:
alist[i],alist[i+1] = alist[i+1],alist[i]
if 0 == count:
return
选择排序
排序过程:
def select_sort(alist):
n = len(alist)
for j in range(n-1):
mid_index = j
for i in range(j+1,n):
if alist[min_index] < alist[i]:
min_index = i
alist[j], alist[min_index] = alist[min_index], alist[j]
插入算法
插入算法分析:
def insert_sort(alist):
for i in range(1,len(alist)):
while i > 0 : n
if alist[i] < alist[i-1]:
alist[i], alist[i-1] = alist[i-1], alist[i]
i -= 1
else:
break;