数据结构python学生成绩排序_Python-数据结构-最全六种排序代码实现

1.冒泡排序

def bubble_sort(alist):

"""冒泡排序"""

n = len(alist)

for j in range(n - 1):

"""j=0,1,2,n-2"""

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:

break

1.1冒泡排序的测试

if __name__ == '__main__':

li = [54, 26, 77, 17, 77, 31, 44, 55, 20]

print(li)

bubble_sort(li)

print(li)

2.选择排序

def selection_sort(alist):

n = len(alist)

""" 需要进⾏n-1次选择操作"""

for i in range(n - 1):

"""记录最⼩位置"""

min_index = i

"""从i+1位置到