给定任意n个整数,按由小到大次序对其进行排序,并输出结果。
时间: 2024-02-22 13:56:30 浏览: 26
除了交换排序和冒泡排序,还有许多其他的排序算法,比如快速排序、归并排序、堆排序等等,它们的时间复杂度不同,适用于不同规模的数据。下面我将给出快速排序和归并排序的实现代码。
快速排序实现代码:
```python
def quick_sort(nums):
if len(nums) <= 1:
return nums
pivot = nums[len(nums) // 2]
left = [x for x in nums if x < pivot]
middle = [x for x in nums if x == pivot]
right = [x for x in nums if x > pivot]
return quick_sort(left) + middle + quick_sort(right)
```
归并排序实现代码:
```python
def merge_sort(nums):
if len(nums) <= 1:
return nums
mid = len(nums) // 2
left = merge_sort(nums[:mid])
right = merge_sort(nums[mid:])
return merge(left, right)
def merge(left, right):
result = []
i = j = 0
while i < len(left) and j < len(right):
if left[i] < right[j]:
result.append(left[i])
i += 1
else:
result.append(right[j])
j += 1
result += left[i:]
result += right[j:]
return result
```
使用示例:
```python
nums = [5, 3, 8, 4, 2]
print(quick_sort(nums)) # [2, 3, 4, 5, 8]
print(merge_sort(nums)) # [2, 3, 4, 5, 8]
```
希望以上代码能够帮助您解决问题。