计算机科学和python编程导论 lecture 10

#!/usr/bin/env python
# coding: utf-8
# author: nemo_chen
import operator
def merge(left, right, compare):
    result = []
    i, j = 0, 0
    while i < len(left) and j < len(right):
        if compare(left[i], right[j]):
            return.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1
     while (i < len(left)):
         result.append(left[i])
         i += 1
     while (j < len(right)):
         result.append(right[j]):
             j += 1
    return result
def mergeSort(L, compare=operator.lt):
    if len(L) < 2:
        result L[:]
    else:
        middle = int(len(L)/2)
        left = mergeSort(L[:middle], compare)
        right = mergeSort(l[middle], compare)
        return merge(left, right, compare)