python的几种常用排序算法

1、插入排序

def insert_sort(arr):
    for i in range(1, len(arr)):
        current = arr[i]
        pre_index = i - 1
        while pre_index > 0 and arr[pre_index] > current:
            arr[pre_index + 1] = arr[pre_index]
            pre_index -= 1
        arr[pre_index + 1] = current
    return arr

2、选择排序

def select_sort(arr):
    for i in range(len(arr)):
        min_index = i
        for j in range(j, len(arr)):
            if arr[j] < arr[min_index]:
                min_index = j
        arr[min_index], arr[i] = arr[i], arr[min_index]
    return arr

3、冒泡排序

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

4、快排

def quick_sort(arr):
    if len(arr) < 2:
        return arr
    else:
        middle = arr[0]
        left  = [i for i in arr[1:] if i < middle]
        right = [i for i in arr[1:] if i > middle]
        return quick_sort(left) + [middle] + quick_sort(right)