python实现归并排序_归并排序的python实现：递归与非递归

递归

原理比较简单，就是有序数组的合并。

def merge(a, b):

c = []

i = j = 0

while i < len(a) and j < len(b):

if a[i] < b[j]:

c.append(a[i])

i += 1

else:

c.append(b[j])

j += 1

while i < len(a):

c.append(a[i])

i += 1

while j < len(b):

c.append(b[j])

j += 1

return c

def merge_sort(lists):

if len(lists) <= 1:

return lists

middle = len(lists) // 2

left = merge_sort(lists[:middle])

right = merge_sort(lists[middle:])

return merge(left, right)

非递归版本

非递归版本不需要额外的空间。直接在原数组上进行切割合并

def merge(seq, low, mid, high):

left = seq[low: mid]

right = seq[mid: high]

k = 0

j = 0

result = []

while k < len(left) and j < len(right):

if left[k] <= right[j]:

result.append(left[k])

k += 1

else:

result.append(right[j])

j += 1

result += left[k:]

result += right[j:]

seq[low: high] = result

def merge_sort(seq):

i = 1 # i是步长

while i < len(seq):

low = 0

while low < len(seq):

mid = low + i #mid前后均为有序

high = min(low+2*i,len(seq))

if mid < high:

merge(seq, low, mid, high)

low += 2*i

i *= 2