python 快速排序代码
时间: 2023-03-16 07:44:12 浏览: 70
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)print(quick_sort([3,6,8,10,1,2,1])) # [1,1,2,3,6,8,10]
相关问题
Python 快速排序代码
快速排序的 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)
print(quick_sort([3,6,8,10,1,2,1]))
python快速排序代码
下面是 Python 实现的快速排序代码:
```
def quick_sort(array):
if len(array) <= 1:
return array
else:
pivot = array[0]
less = [x for x in array[1:] if x <= pivot]
greater = [x for x in array[1:] if x > pivot]
return quick_sort(less) + [pivot] + quick_sort(greater)
```
该代码使用了列表解析式来实现快速排序的递归过程。