Python 常用排序算法

冒泡排序

def bubbl_sort(sort_list):
    lenght = len(sort_list)
    for i in range(lenght):
        for j in range(lenght-1):
            if sort_list[j] > sort_list[j+1]:
                sort_list[j],sort_list[j+1] = sort_list[j+1],sort_list[j]
    return sort_list
sort_list = [3,4,1,13,8,3,12,3,17,123]
print(bubbl_sort(sort_list))
output : [1, 3, 3, 3, 4, 8, 12, 13, 17, 123]

快速排序

def quick_sort(sort_list):
    if len(sort_list)<2:
        return sort_list
    mid = sort_list[len(sort_list)//2]
    left = []
    right=[]
    sort_list.remove(mid)
    for i in sort_list:
        if i <= mid :
            left.append(i)
        elif i > mid:
            right.append(i)
    return quick_sort(left) + [mid] + quick_sort(right)
    
sort_list = [3,4,1,13,8,3,12,3,17,123]
print(quick_sort(sort_list))

output : [1, 3, 3, 3, 4, 8, 12, 13, 17, 123]

归并排序

def MergeSort(lists):
    if len(lists) <= 1:
        return lists
    num = int(len(lists) / 2)
    left = MergeSort(lists[:num])
    right = MergeSort(lists[num:])

    return Merge(left, right)


def Merge(left, right):
    r, l = 0, 0
    result = []
    while l < len(left) and r < len(right):
        if left[l] <= right[r]:
            result.append(left[l])
            l += 1
        else:
            result.append(right[r])
            r += 1
    result += list(left[l:])
    result += list(right[r:])
    return result


print(MergeSort([1, 4, 3, 2, 5, 6, 7, 90, 21, 23, 45]))

参考链接：
https://www.cnblogs.com/onepixel/articles/7674659.html
https://baike.baidu.com/item/%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F/1639015

关注公众号学更多技术