编写代码分别用堆排序及快速排序算法,对待排序记录进行排序并输出排序结果。
时间: 2023-07-07 21:35:31 浏览: 45
好的,以下是 Python 代码实现:
堆排序:
```python
def heap_sort(arr):
n = len(arr)
for i in range(n // 2 - 1, -1, -1):
heapify(arr, n, i)
for i in range(n - 1, 0, -1):
arr[0], arr[i] = arr[i], arr[0]
heapify(arr, i, 0)
return arr
def heapify(arr, n, i):
largest = i
l = 2 * i + 1
r = 2 * i + 2
if l < n and arr[l] > arr[largest]:
largest = l
if r < n and arr[r] > arr[largest]:
largest = r
if largest != i:
arr[i], arr[largest] = arr[largest], arr[i]
heapify(arr, n, largest)
arr = [12, 11, 13, 5, 6, 7]
print("原数组:", arr)
print("堆排序后:", heap_sort(arr))
```
快速排序:
```python
def quick_sort(arr, low, high):
if low < high:
pi = partition(arr, low, high)
quick_sort(arr, low, pi - 1)
quick_sort(arr, pi + 1, high)
def partition(arr, low, high):
pivot = arr[high]
i = low - 1
for j in range(low, high):
if arr[j] < pivot:
i += 1
arr[i], arr[j] = arr[j], arr[i]
arr[i + 1], arr[high] = arr[high], arr[i + 1]
return i + 1
arr = [12, 11, 13, 5, 6, 7]
n = len(arr)
quick_sort(arr, 0, n - 1)
print("原数组:", arr)
print("快速排序后:", arr)
```
注意,以上代码仅供参考,实际使用时建议先进行测试和优化。