基于python实现快速排序、随机快速排序

最新推荐文章于 2026-03-01 05:20:42 发布

原创最新推荐文章于 2026-03-01 05:20:42 发布 · 1.6k 阅读

7 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#python #排序算法 #算法

笔记分享专栏收录该内容

5 篇文章

订阅专栏

1.快速排序

import random
import time


def quickSort(listToSort, left, right):
    if (left < right):
        pivot = Partition(listToSort, left, right)
        quickSort(listToSort, left, pivot - 1)
        quickSort(listToSort, pivot + 1, right)


def Partition(listToSort, left, right):
    x = listToSort[right]
    p = left - 1
    for i in range(left, right):
        if (listToSort[i] <= x):
            p += 1
            listToSort[p], listToSort[i] = listToSort[i], listToSort[p]
    listToSort[p + 1], listToSort[right] = listToSort[right], listToSort[p + 1]
    return p + 1


def createTheSequenceRand(listToFill, numberOfElem):
    for i in range(1, numberOfElem + 1):  # Fill the sequence with all different numbers
        listToFill.append(i)

    random.shuffle(listToFill)  # Shuffling the sequence


if __name__ == "__main__":

    listOf10 = []

    createTheSequenceRand(listOf10, 10000000)  # Creating the sequence

    f = open("input10.txt", "w+")
    for i in listOf10:  # Setting an output file
        f.write(str(i) + "\n")

    listToSort = listOf10
    start = time.time()
    quickSort(listToSort, 0, len(listToSort) -1)
    print(time.time() - start)

    f = open("output10.txt", "w+")

    for i in listToSort:
        f.write(str(i) + "\n")

2.随机快速排序1

def quickSort(listToSort, left, right):
    if (left < right):
        pivot = randomPartition(listToSort, left, right)
        quickSort(listToSort, left, pivot - 1)
        quickSort(listToSort, pivot + 1, right)


def randomPartition(listToSort, left, right):
    randpivot = random.randrange(left, right)
    listToSort[right], listToSort[randpivot] = listToSort[randpivot], listToSort[right]
    return Partition(listToSort, left, right)

3.随机快速排序2

def quickSort(listToSort, left, right):
    if (left < right):
        pivot = randomPartition(listToSort, left, right)
        quickSort(listToSort, left, pivot - 1)
        quickSort(listToSort, pivot + 1, right)


def randomPartition(listToSort, left, right):
    thread = 0.75 * len(listToSort)
    success = False
    while (not success):
        randpivot = random.randrange(left, right)
        l = randpivot - left  # 左半部分的长度
        r = right - randpivot  # 右半部分的长度
        if (l <= thread and r <= thread and len(listToSort) != 2):  # 满足好枢纽的条件以及子问题的元素要大于2
            success = True
        # print("left：{}, right：{}, randpivot：{}, l：{}, r：{}, thread：{}".format(left, right, randpivot, l, r, thread))
    listToSort[right], listToSort[randpivot] = listToSort[randpivot], listToSort[right]
    return Partition(listToSort, left, right)