python的六种排序方法

最新推荐文章于 2023-06-08 14:30:00 发布

爱上课睡觉的哥哥

最新推荐文章于 2023-06-08 14:30:00 发布

阅读量820

点赞数

分类专栏： PYTHON 文章标签： python 六种排序

本文链接：https://blog.csdn.net/w51240/article/details/78245694

版权

PYTHON 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

# -*- coding:utf-8 -*-

# 冒泡
def bubble_sort(num_list):
    for i in range(len(num_list)):
        for j in range(len(num_list)-1-i):
            if num_list[j] > num_list[j+1]:
                num_list[j], num_list[j+1] = num_list[j+1], num_list[j]

# 选择
def select_sort(num_list):
    for i in range(len(num_list)-1):
        for j in range(i+1, len(num_list)):
            if num_list[i] > num_list[j]:
                num_list[i], num_list[j] = num_list[j], num_list[i]

# 插入
def insert_sort(num_list):
    for i in range(1, len(num_list)):
        for j in range(i, 0, -1):
            if num_list[j] < num_list[j-1]:
                num_list[j], num_list[j-1] = num_list[j-1], num_list[j]

# 希尔
def select_sort(num_list):
    n = len(num_list)
    gap = n // 2
    while gap > 0:
        for i in range(gap, n):
            for j in range(i, gap-1, -gap):
                if num_list[j] < num_list[j - gap]:
                    num_list[j], num_list[j - gap] = num_list[j - gap], num_list[j]
        gap //= 2

# 快速
def quick_sort(num_list):
    return quick_sort_assist(num_list, 0, len(num_list)-1)


def quick_sort_assist(num_list, start, end):
    if start >= end:
        return
    low = start
    high = end
    mid = num_list[low]
    while low < high:
        while low < high and num_list[high] >= mid:
            high -= 1
        num_list[low] = num_list[high]
        while low < high and num_list[low] < mid:
            low += 1
        num_list[high] = num_list[low]
    num_list[low] = mid
    quick_sort_assist(num_list, start, low - 1)
    quick_sort_assist(num_list, low + 1, end)

# 混合
def merge_sort(num_list):
    if len(num_list) <= 1:
        return num_list
    num = len(num_list)//2
    left = merge_sort(num_list[:num])
    right = merge_sort(num_list[num:])
    return merge(left, right)


def merge(left, right):
    l, r = 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 += left[l:]
    result += right[r:]
    return result