Python 归并排序
归并排序采用分而治之的方法,递归求解。
- 将长度为n的列表分成两个长度为n/2的子序列
- 对两个子序列分别采用归并排序
- 将两个排序好的子序列合并成一个最终的排序列表
代码如下:
# -*- coding:utf-8 _*-
# @Author: dreams
# @File: merge_sort.py
# @Time: 2018/7/26 9:29
import random
def merge(left, right):
i, j = 0, 0
results = list()
while i < len(left) and j < len(right):
if left[i] <= right[j]:
results.append(left[i])
i += 1
else:
results.append(right[j])
j += 1
results += left[i:]
results += right[j:]
return results
def merge_sort(array):
# 结束递归条件
if len(array) <= 1:
return array
length = len(array) // 2
# 对切片递归调用归并排序函数进行排序
left = merge_sort(array[:length])
right = merge_sort(array[length:])
# 合并分片
return merge(left, right)
array = [random.randrange(100) for i in range(10)]
print 'before sort:\n', array
print("-------final-------")
print merge_sort(array)
输出结果:
before sort:
[60, 99, 39, 37, 35, 94, 85, 27, 39, 89]
-------final-------
[27, 35, 37, 39, 39, 60, 85, 89, 94, 99]