python实现选择排序和快速排序

1.选择排序,时间复杂度位n^2

def choice_sort(array):
    for i in range(len(array)):
        for j in range(i, len(array)):
            if array[i] > array[j]:
                array[i], array[j] = array[j], array[i]
    return array

2.快速排序,时间复杂度位n*logn

def quick_sort(array):
    if len(array) < 2:
        return array
    else:
        temp = array[0]
        less = [i for i in array[1:] if i <= temp]
        bigger = [i for i in array[1:] if i > temp]
        return quick_sort(less) + [temp] + quick_sort(bigger)