效率比较高的归并排序, 有两种方式。
1.使用递归
def merge(left, right):
result = []
i,j = 0, 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
def merge_sort(data):
if len(data) <= 1:
return data
else:
m = len(data) / 2
left = merge_sort(data[:m])
right = merge_sort(data[m:])
return merge(left, right)
2.不使用递归
def merge_pass(data, offset):
i = 0
while i < len(data) - 2*offset:
data[i:i + offset*2] = merge(data[i:i + offset], data[i + offset:i + offset*2])
i += 2 * offset
if i < len(data) - offset:
data[i:] = merge(data[i:i + offset], data[i + offset:])
return data
def merge_sort2(data):
k = 1
while k < len(data):
data = merge_pass(data, k)
k *= 2
return data
其中的merge仍然使用1中的merge方法。