主程序如下：

from random import randint
import time
import copyGA_MAX = 19		#待排序的数据的数量
ga = [randint(0, 199) for i in range(GA_MAX)]	#待排序的数据
ga_copy = []	#用于检测排序结果def print_ga():# print(ga)print(''.join(str(i) + ' ' for i in ga))def random_ga():ga = [randint(0,GA_MAX-1) for i in range(20)]def check_rsult():		#检查排序结果：期望是从大到小排序for i in range(GA_MAX):if ga_copy[i] not in ga:return Falsefor i in range(GA_MAX-1):if ga[i] < ga[i+1]:return Falsereturn Truedef sort_main():global ga_copyprint_ga()ga_copy = copy.deepcopy(ga)time_start = time.perf_counter()# 具体的算法写在这里,从小到大 或者 从大到小# bubble_sort()# select_sort()# insert_sort()# insert_sort_half()# quick_sort()# heap_sort()# shell_sort()# merge_sort()time_cost = (time.perf_counter() - time_start) * 1000print('time_cost: {:g}ms'.format(time_cost))print_ga()print('check_rsult = ', check_rsult())return time_cost    # msif __name__ == '__main__':sort_main()

运行结果参考：

27 93 12 43 111 4 67 1 121 118 112 48 170 101 19 119 62 177 23 
time_cost: 0.044ms
177 170 121 119 118 112 111 101 93 67 62 48 43 27 23 19 12 4 1 
check_rsult =  True

#冒泡排序  从小到大和从大到小
def bubble_sort():  # O(n*n)  稳定"""冒泡排序"""# ascendfor j in range(GA_MAX):for i in range(GA_MAX-j-1):if ga[i] > ga[i+1]:ga[i], ga[i+1] = ga[i+1], ga[i]def bubble_sort():for i in range(GA_MAX-1):for j in range(0, GA_MAX-i-1, 1):if ga[j] < ga[j+1]:ga[j], ga[j+1] = ga[j+1], ga[j]

# 如果向稳定排序，方法一，每次交换改为向后整体移位  方法二，组件新的数组
def select_sort():  # O(n*n)  不稳定"""选择排序"""# ascendfor j in range(GA_MAX):t = jfor i in range(j + 1, GA_MAX):if ga[i] < ga[t]:t = iga[j], ga[t] = ga[t], ga[j]def select_sort():for i in range(GA_MAX-1):t = ifor j in range(i+1, GA_MAX, 1):if ga[j] > ga[t]:t = jif t != i:ga[i], ga[t] = ga[t], ga[i]

def insert_sort():    # O(n*n)  稳定"""插入排序"""# ascendfor i in range(1, GA_MAX):for j in range(i, 0, -1):   # ga[i] 就是本次要插入的数据if ga[j] < ga[j-1]:     # 比较次数较多ga[j-1], ga[j] = ga[j], ga[j-1]     # 牺牲交换次数，换来代码整洁# 前面已经是有序数据，仍然要比较i次def insert_sort_2():for i in range(1, GA_MAX):focus = ga[i]j = 0for j in range(i-1, -1, -1):if focus < ga[j]:       # 增加了break，找到即停，但这里使用的是顺序查找，最坏情况要比较i次ga[j+1] = ga[j]     # 相比上面算法，这里只做一次赋值else:j += 1  # 更新为focus的位置break   # 找到插入位置，就停止比较ga[j] = focusdef insert_sort_half():for i in range(1, GA_MAX):focus = ga[i]# 需要比较[0,i-1], 将顺序查找改为折半查找a = 0b = i-1j = 0while b >= a:j = int((b - a) / 2) + aif focus < ga[j]:b = j-1if b >= 0 and ga[b] <= focus:break   # j 就是focus的位置elif j == 0:break   # j 就是focus的位置else:a = j+1if a <= i-1 and ga[a] > focus:j = abreak   # j 就是focus的位置elif j == i-1:j = abreak   # j 就是focus的位置for t in range(i, j, -1):ga[t] = ga[t-1]ga[j] = focus#从大到小-------------------------------------
def insert_sort():for i in range(1, GA_MAX, 1):t = ga[i]for j in range(i-1, -1, -1):if ga[j] < t:ga[j+1] = ga[j]if j == 0:ga[j] = telse:if j+1 != i:ga[j+1] = tbreakdef half_search(start,end,v):a = startb = endwhile a <= b:n = int(a + (b - a)/2)if ga[n] >= ga[v]:if n == end or ga[n+1] < ga[v]:return n+1a = n+1else:if n == start or ga[n-1] >= ga[v]:return nb = n-1def insert_sort_half():for i in range(1, GA_MAX, 1):t = ga[i]n = half_search(0, i-1, i)for j in range(i, n, -1):ga[j] = ga[j-1]ga[n] = t

def quick_sort_do(x, y):if x >= y:returnbase = ga[x]i = xj = ywhile i < j:while j > i:if ga[j] < base:ga[i] = ga[j]i += 1breakj -= 1while i < j:if ga[i] > base:ga[j] = ga[i]j -= 1breaki += 1ga[i] = basequick_sort_do(x, i-1)quick_sort_do(i+1, y)def quick_sort_ResponseGroup(begin, end):passdef quick_sort():"""快速排序"""# ascendquick_sort_do(0, GA_MAX-1)#quick_sort_ResponseGroup(0, GA_MAX-1)#从大到小
def quick_sort_do(start, end):if start >= end:returnbase = ga[start]i = startj = endwhile i<j:while i<j:if ga[j]>base:ga[i] = ga[j]i += 1breakj -= 1while i < j:if ga[i] < base:ga[j] = ga[i]j -= 1breaki += 1ga[i] = basequick_sort_do(start, i-1)quick_sort_do(i+1, end)def quick_sort():quick_sort_do(0, GA_MAX-1)

def heap_sort_do(f, sum):if sum <= 1 or f >= GA_MAX:returnl = 2 * f + 1r = 2 * f + 2# 第一版代码'''if l < sum and ga[l] > ga[f]:ga[l], ga[f] = ga[f], ga[l]if r < sum and ga[r] > ga[f]:ga[r], ga[f] = ga[f], ga[r]if l < sum:heap_sort_do(l, sum)if r < sum:heap_sort_do(r, sum)'''# r 有效，则l必有效if r < sum and ga[l] < ga[r]:l = rif l < sum and ga[l] > ga[f]:ga[l], ga[f] = ga[f], ga[l]heap_sort_do(l, sum)def heap_sort():"""大推排序"""# ascend# print(''.join(str(i) + ' ' for i in range(GA_MAX)))for i in range(GA_MAX-1, 0, -2):    # setupf = int((i - 1) / 2)heap_sort_do(f, GA_MAX)for count in range(1, GA_MAX):ga[0], ga[GA_MAX-count] = ga[GA_MAX-count], ga[0]heap_sort_do(0, GA_MAX-count)

def shell_sort():"""希尔排序"""gap = int(GA_MAX/2)     # 希尔增量while gap >= 1:for sub in range(gap):for i in range(sub+gap, GA_MAX, gap):   # 每个子序列采用插入排序, x x+gap x+2gap x+3gapfocus = ga[i]j = 0for j in range(i - gap, -1, -gap):if focus < ga[j]:  # 增加了break，找到即停，但这里使用的是顺序查找，最坏情况要比较i次ga[j + gap] = ga[j]  # 相比上面算法，这里只做一次赋值else:j += gap  # 更新为focus的位置break  # 找到插入位置，就停止比较ga[j] = focusgap = int(gap/2)

def merge_sort():"""归并排序"""gt = [0 for i in range(GA_MAX)]sub_num = 1     # 各子序列成员最大数while sub_num < GA_MAX:for i in range(0, GA_MAX, 2 * sub_num):j = i + sub_numimax = i + sub_numif imax > GA_MAX:imax = GA_MAXjmax = j + sub_numif jmax > GA_MAX:jmax = GA_MAXt = iwhile i < imax and j < jmax:if ga[i] > ga[j]:gt[t] = ga[j]j += 1else:gt[t] = ga[i]i += 1t += 1if i == t:  # ga[i-j] 无需改变continuewhile i < imax:gt[t] = ga[i]t += 1i += 1while j < jmax:gt[t] = ga[j]t += 1j += 1for i in range(2*sub_num):  # 将数据拷回去t -= 1if 0 <= t < GA_MAX:ga[t] = gt[t]sub_num = 2*sub_num#从大到小
# 合并两个任意长度的数组/列表
def merge_do(lstart, lend, rstart, rend):l=lstartr=rstarttlist = []while l<=lend and r<=rend:if ga[l]>=ga[r]:tlist.append(ga[l])l += 1else:tlist.append(ga[r])r += 1if l<=lend:tlist += ga[l:lend+1]if r<=rend:tlist += ga[r:rend+1]l=lstartfor item in tlist:ga[l] = iteml += 1def merge_divide(start, end):# 1分为2num = end-start+1smiddle = start+ int(num/2) -1if smiddle>start:    # 调用2分接口，从而调用合并接口merge_divide(start, smiddle)if end>smiddle+1:merge_divide(smiddle+1, end)# 合并if end > start:merge_do(start, smiddle, smiddle+1, end)def merge_sort():merge_divide(0, GA_MAX-1)