两种快排

import time
import random
import copy


# ######################1#######################
def quicksort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quicksort(left) + middle + quicksort(right)


# ######################2#######################
def partition(data, left, right):
    tmp = data[left]
    while left < right:
        while left < right and data[right] >= tmp:
            right -= 1
        data[left] = data[right]
        while left < right and data[left] <= tmp:
            left += 1
        data[right] = data[left]
    data[left] = tmp
    return left


def quick_sort(data, left, right):
    if left < right:
        mid = partition(data, left, right)
        quick_sort(data, left, mid - 1)
        quick_sort(data, mid + 1, right)


# #################################################
l1 = list(range(100000))
random.shuffle(l1)
l2 = copy.deepcopy(l1)


# ********************多列表排序**************************
t1 = time.time()
l1 = quicksort(l1)
t2 = time.time()
print(t2 - t1)
time.sleep(1)


# ****************单列表排序************
t1 = time.time()
length = len(l2) - 1
quick_sort(l2, 0, length)
t2 = time.time()
print(t2 - t1)

多列表排序空间复杂度高，相对慢一些