# coding:utf-8
import random
import time
def bubble_sort(alist):
"""冒泡"""
n = len(alist)
for j in range(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]
count += 1
if 0 == count:
return
def select_sort(alist):
"""选择"""
n = len(alist)
for j in range(n-1):
min_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):
"""插入"""
n = len(alist)
for j in range(1, n):
i = j
while i > 0:
if alist[i] < alist[i-1]:
alist[i], alist[i-1] =
python(三)6种排序算法性能比较(冒泡、选择、插入、希尔、快速、归并)
最新推荐文章于 2024-04-24 09:20:34 发布