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)
<h1>示例使用</h1><p>data = [3, 6, 8, 10, 1, 2, 1]
sorted_data = quicksort(data)
<strong>print(sorted_data)</strong>  # 输出: [1, 1, 2, 3, 6, 8, 10]</p>

def quicksort_inplace(arr, low, high):
    if low < high:
        pi = partition(arr, low, high)
        quicksort_inplace(arr, low, pi - 1)
        quicksort_inplace(arr, pi + 1, high)
<p>def partition(arr, low, high):
pivot = arr[high]
i = low - 1
for j in range(low, high):
if arr[j] <= pivot:
i += 1
arr[i], arr[j] = arr[j], arr[i]
arr[i + 1], arr[high] = arr[high], arr[i + 1]
return i + 1</p><h1>使用示例</h1><p>data = [3, 6, 8, 10, 1, 2, 1]
quicksort_inplace(data, 0, len(data) - 1)
<strong>print(data)</strong>  # 输出: [1, 1, 2, 3, 6, 8, 10]</p>