三种常见排序算法

三种常见排序算法

# 1 冒泡排序
def bubble_sort(alist):
    n = len(alist)
    for j in range(n-1):
            for i in range(n-1-j):
                if alist[i]>alist[i+1]:
                    alist[i+1],alist[i] = alist[i],alist[i+1]
    print(alist)

alist = [2,4,1,6,0]
bubble_sort(alist)

[0, 1, 2, 4, 6]

# 2. 选择排序
def select_sort(alist):
    n = len(alist)
    for j in range(n-1):
        min = j
        for i in range(1+j, n):
            if alist[i] < alist[min]:
                min = i
            alist[min],alist[j] = alist[j],alist[min]
    print(alist)

alist = [2,4,1,6,0]
select_sort(alist)

[0, 1, 2, 4, 6]

def insert_sort(alist):
    n = len(alist)
    for i in range(1, n):
        j = i
        while j > 0:
            if alist[j-1] > alist[j]:
                alist[j],alist[j-1] = alist[j-1],alist[j]
                j -= 1
            else:
                break
    print(alist)

alist = [2,4,1,6,0]
insert_sort(alist)

[0, 1, 2, 4, 6]