merge sort

#/usr/bin/env python[2,3]

import math

def merge(left, right):
    y = []

    nL = len(left) - 1
    nR = len(right) - 1

    il = 0

    print("Ne Zahl: " + str(nL + nR + 2))

    for i in range(nL + nR + 2):
        if (il > nL):
            y.append(right[i - il])
            continue

        if (il < i - nR):
            y.append(left[il])
            il += + 1
            continue

        if (left[il] <= right[i - il]):
            y.append(left[il])
            il += 1
        else:
            y.append(right[i - il])

    return y

def merge_sort(x):
    if (len(x) <= 1):
        return x

    nx = len(x) - 1

    # split list
    nL = int(math.floor(nx * 0.5) + 1)
    nR = int(math.floor(nx * 0.5) + 1)

    left = x[:nL]
    right = x[nR:]
    print("liste: " + str(x))
    print("left: " + str(left))
    print("right: " + str(right))

    left = merge_sort(left)
    right = merge_sort(right)

    return merge(left, right)

liste = [1, 4, 2, 3, 5, 10, 6, 3, 6, 2121, 121, 12, 32, 11232, 45, 21321, 546, 768, 5465, 34, 23, 546, 324, 54654, 324, 5464, 435, 56, 564, 546, 546, 54645, 56,546 , 545654
        ,5645 , 546,45 ,45 ,54 ,5 ,5 ,5 ,5]
print(merge_sort(liste))