快速排序和归并排序的代码
时间: 2024-10-16 21:14:33 浏览: 11
快速排序和归并排序都是常用的排序算法,它们各有特点。
**快速排序 (Quick Sort):**
```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)
# 示例
arr = [3,6,8,10,1,2,1]
sorted_arr = quick_sort(arr)
```
**归并排序 (Merge Sort):**
```python
def merge_sort(arr):
if len(arr) <= 1:
return arr
mid = len(arr) // 2
left_half = arr[:mid]
right_half = arr[mid:]
left_half = merge_sort(left_half)
right_half = merge_sort(right_half)
return merge(left_half, right_half)
def merge(left, right):
merged = []
left_index = 0
right_index = 0
while left_index < len(left) and right_index < len(right):
if left[left_index] < right[right_index]:
merged.append(left[left_index])
left_index += 1
else:
merged.append(right[right_index])
right_index += 1
merged.extend(left[left_index:])
merged.extend(right[right_index:])
return merged
# 示例
arr = [3,6,8,10,1,2,1]
sorted_arr = merge_sort(arr)
```
阅读全文