腾龙AI智能体
让编程效率提升10倍

# 腾龙AI帮你写一个快速排序算法
def quick_sort(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 quick_sort(left) + middle + quick_sort(right)

# 测试用例
arr = [3,6,8,10,1,2,1]
print(quick_sort(arr))