归并算法图解
#!/usr/bin/env python
# -*- coding:utf-8 -*-
def merge_sorting(ls):
if len(ls)<2:
return ls
mid = len(ls) >> 1
left = merge_sorting(ls[:mid])
right = merge_sorting(ls[mid:])
return merge(left,right)
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
print(merge_sorting([1,4,6,32,6]))
网友评论