归并排序 MergeSort

def mergeSort(arry,left,right):if left < right:mid = (left + right) / 2mergeSort(arry,left,mid)mergeSort(arry,mid+1,right)mergeArry(arry,left,right,mid)return arrydef mergeArry(arry,left,right,mid):i = leftj = mid + 1temp = []while i <= mid and j <= right:if arry[i] <= arry[j]:temp.append(arry[i])i+=1else:temp.append(arry[j])j+=1while i <= mid:temp.append(arry[i])i+=1while j <= right:temp.append(arry[j])j+=1for i in range(left,right+1):arry[i] = temp[i-left]