归并排序——python

归并排序：

        分治（divide and conquer）。

def mergeSort2(alist):
    if len(alist) < 2:
        return alist
    middle = len(alist)//2
    left = mergeSort2(alist[:middle])
    right = mergeSort2(alist[middle:])
    
    i = 0
    j = 0
    result = []
    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

python内置heapq自带merge函数实现归并排序，更简洁。

from heapq import merge
def mergeSort(seq):
    if len(seq)<=1:
        return seq
    else:
        middle = len(seq)//2
        left = mergeSort(seq[:middle])
        right = mergeSort(seq[middle:])
        return list(merge(left, right))