快速排序

import random


def quickSort(arr, left, right):
    if left >= right:
        return
    pivot = random.randint(left, right)
    arr[pivot], arr[right] = arr[right], arr[pivot]
    q = left
    p = left - 1
    while q < right:
        if arr[q] < arr[right]:
            p += 1
            arr[p], arr[q] = arr[q], arr[p]
        q += 1
    p += 1
    arr[p], arr[right] = arr[right], arr[p]
    quickSort(arr, left, p - 1)
    quickSort(arr, p + 1, right)


def sort(arr):
    if not arr:
        return []
    lenArr = len(arr)
    quickSort(arr, 0, lenArr - 1)
    return arr


print(sort([3, 2, 1, 5, 4]))