13 lines
317 B
Python
13 lines
317 B
Python
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)
|