归并排序（python版）

1、 描述

将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为二路归并

2、思想

分治

3、代码

import random
nums = []
for i in range(10):nums.append(random.randint(0, 10))

def merge_sort(nums):
    if len(nums) == 1:
        return nums
    mid = len(nums)//2
    left = nums[:mid]
    right = nums[mid:]
    l = merage_sort(left)
    r= merage_sort(right)
    return merge(l, r)

def merge(left, right):
    result = []
    while len(left) > 0 and len(right) > 0:
        if left[0] <= right[0]:
            result.append(left.pop(0))
        else:
            result.append(right.pop(0))
    result += left
    result += right
    return result

print("the raw nums is:", nums)
sorted_nums = merge_sort(nums)
print("the sorted nums is:", sorted_nums)