python简单的四种排序算法

插入排序

def insert_sort(arr):
    length = len(arr)
    for i in range(1, length):
        loop_index = i
        while loop_index >= 0 and arr[loop_index] < arr[loop_index - 1]:
            arr[loop_index], arr[loop_index - 1] = arr[loop_index - 1], arr[loop_index]
            loop_index -= 1
    return arr

选择排序

def select_sort(arr):
    length = len(arr)
    for i in range(0,length-1):
        lep = i
        for j in range(i+1,length):
            if arr[lep] > arr[j]:
                lep = j
        arr[i], arr[lep] = arr[lep], arr[i]
    return arr

快速排序

def quick_sort(l):
    if len(l)<=1:
        return l
    data = l.pop()
    left = []
    right = []
    for i in range(len(l)):
        if data < l[i]:
            right.append(l[i])
        else:
            left.append(l[i])
    return quick_sort(left) +[data] + quick_sort(right)

冒泡排序

def bubble_sort(arr):
    for i in range(len(arr)-1):
        for j in range(i,len(arr)):
            if arr[i] > arr[j]:
                arr[i], arr[j] = arr[j], arr[i]
    return arr