def mergeSort(listData):
    if len(listData) <= 1:
        return listData
    Middle = len(listData) // 2
    Left, Right = mergeSort(listData[:Middle]), mergeSort(listData[Middle:])
    return merge(Left, Right)

def merge(Left, Right):
    Result = []
    i, j = 0 , 0
    while i < len(Left) and j < len(Right):
        if Left[i] <= Right[j]:
            Result.append(Left[i])
            i += 1
        else:
            Result.append(Right[j])
            j += 1
    Result.extend(Left[i:])
    Result.extend(Right[j:])
    return Result

lstA = [1, 3, 2, 7, 11, 5, 3]
lstA = mergeSort(lstA)
print(lstA)