当然！以下是一个 Python 实现的快速排序算法：
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)
# 测试
arr = [3, 6, 8, 10, 1, 2, 1]
print(quicksort(arr)) # [1, 1, 2, 3, 6, 8, 10]