Merge sort part 2

merge_sort_2.py

def Merge(left, right):
    output = []
    x, y = 0, 0
    while x < len(left) and y < len(right):
        if left[x] <= right[y]:
            output.append(left[x])
            x += 1
        else:
            output.append(right[y])
            y += 1
    output += left[x:]
    output += right[y:]
    return output