快排,堆排,归并排序的实现

import random
import copy

# -------------------------------------------------快排--------------------------------------
def partion(li, left, right):
    temp = li[left]
    while left < right:
        while left < right and li[right] >= temp:
            right -= 1
        li[left] = li[right]
        while left < right and li[left] <= temp:
            left += 1
        li[right] = li[left]
    li[left] = temp
    return left


def quick_sort(li, left, right):
    if left < right:
        mid = partion(li, left, right)
        quick_sort(li, left, mid)
        quick_sort(li, mid + 1, right)


# ------------------------------------------------堆排-----------------------------------
def sift(li, low, height):
    temp = li[low]
    i = low
    j = 2*i + 1
    while j <= height:
        if j + 1 <= height and li[j] < li[j+1]:
            j = j+1
        if temp < li[j]:
            li[i] = li[j]
            i = j
            j = 2*i + 1
        else:
            li[i] = temp
            break
    li[i] = temp


def heap_sort(li):
    n = len(li)
    # 建堆
    for i in range((n - 2)//2, -1, -1):
        sift(li, i, n - 1)

    # 向下调整
    for i in range(n-1, -1, -1):
        li[0], li[i] = li[i], li[0]
        sift(li, 0, i - 1)


# -----------------------------------------归并排序------------------------------------
def merge(li, left, mid, right):
    i = left
    j = mid + 1
    temp = []
    while i <= mid and j <= right:
        if li[i] < li[j]:
            temp.append(li[i])
            i += 1
        else:
            temp.append(li[j])
            j += 1
    while i <= mid:
        temp.append(li[i])
        i += 1
    while j <= right:
        temp.append(li[j])
        j += 1
    li[left:right+1] = temp


def merge_sort(li, left, right):
    if left < right:
        mid = (left + right) // 2
        merge_sort(li, left, mid)
        merge_sort(li, mid + 1, right)
        merge(li, left, mid, right)


li1 = list(range(100))
random.shuffle(li1)
print("快排前********************************")
print(li1)
quick_sort(li1, 0, len(li1)-1)
print("快排后********************************")
print(li1)

li2 = copy.deepcopy(li1)
random.shuffle(li2)
print("堆排前********************************")
print(li2)
heap_sort(li2)
print("堆排后********************************")
print(li2)

li3 = copy.deepcopy(li1)
random.shuffle(li3)
print("归排前********************************")
print(li3)
merge_sort(li3, 0, len(li3)-1)
print("归排后********************************")
print(li3)

结果为:

快排前********************************
[85, 39, 71, 22, 83, 53, 75, 18, 96, 4, 66, 72, 95, 27, 35, 50, 3, 82, 93, 88, 12, 17, 65, 2, 84, 5, 86, 38, 6, 74, 52, 41, 68, 98, 79, 49, 69, 78, 11, 99, 47, 36, 19, 8, 63, 51, 37, 30, 67, 28, 34, 48, 20, 92, 25, 81, 7, 9, 97, 32, 56, 73, 13, 43, 10, 31, 16, 62, 33, 61, 0, 29, 26, 1, 14, 58, 57, 21, 76, 77, 89, 23, 44, 42, 64, 87, 60, 54, 55, 90, 94, 70, 91, 40, 59, 45, 24, 46, 80, 15]
快排后********************************
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
堆排前********************************
[77, 43, 98, 76, 1, 79, 2, 69, 96, 89, 33, 72, 55, 48, 66, 84, 67, 10, 14, 12, 80, 97, 92, 53, 74, 51, 38, 4, 87, 25, 56, 24, 65, 40, 27, 6, 37, 78, 17, 35, 68, 54, 32, 16, 57, 5, 75, 18, 39, 99, 28, 41, 95, 44, 59, 91, 22, 81, 8, 21, 9, 63, 36, 58, 52, 86, 50, 64, 46, 30, 85, 49, 70, 83, 73, 93, 7, 20, 42, 19, 60, 11, 13, 34, 47, 61, 94, 71, 0, 3, 82, 88, 29, 31, 26, 45, 15, 62, 90, 23]
堆排后********************************
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
归排前********************************
[81, 14, 76, 73, 63, 75, 25, 70, 92, 57, 15, 5, 56, 7, 79, 69, 77, 62, 46, 22, 85, 60, 87, 44, 66, 48, 42, 2, 27, 80, 0, 20, 29, 18, 12, 34, 51, 28, 89, 74, 64, 83, 43, 21, 6, 13, 50, 37, 30, 17, 68, 35, 88, 19, 97, 32, 52, 36, 95, 93, 16, 58, 91, 26, 33, 49, 11, 90, 23, 40, 71, 72, 53, 65, 94, 38, 39, 1, 8, 98, 67, 99, 9, 61, 82, 54, 59, 24, 96, 4, 86, 55, 10, 31, 41, 84, 45, 78, 3, 47]
归排后********************************
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]

Process finished with exit code 0

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值