各种排序算法

排序算法

快速排序

def quickSort(arr):
    if len(arr)<2:
        return arr
    temp = arr[0]
    less = list(i for i in arr[1:] if i<=temp)
    greater = list(i for i in arr[1:] if i>temp)
    return quickSort(less) + [temp] + quickSort(greater)

if __name__ == '__main__':
    arr = [1,0,5,23,6,2,-1]
    rslt = quickSort(arr)
    print(rslt)

冒泡排序

def my_sort(li):#第二种方式
    for i in range(len(li)):
        for j in range(len(li)-i-1):
            if li[j] > li[j+1]:
                li[j],li[j+1] = li[j+1],li[j]
    return li

if __name__ == '__main__':
    li = [3,12,45,1,0,8]
    print(my_sort(li))