merge_sort.py

def merge(leftSubList, rightSubList):
    iLeftIterator = 0
    jRightIterator = 0

    mergedList = []

    while iLeftIterator < len(leftSubList) and jRightIterator < len(rightSubList):
        if leftSubList[iLeftIterator] <= rightSubList[jRightIterator]:
            mergedList.append(leftSubList[iLeftIterator])
            iLeftIterator = iLeftIterator + 1

        else:
            mergedList.append(rightSubList[jRightIterator])
            jRightIterator = jRightIterator + 1

    mergedList = mergedList + leftSubList[iLeftIterator:]
    mergedList = mergedList + rightSubList[jRightIterator:]

    return mergedList


def splitAndMerge(theList):
    if len(theList) <= 1:
        return theList
    else:
        midpoint = int(len(theList)/2)
        leftSubList = splitAndMerge(theList[:midpoint])
        rightSubList = splitAndMerge(theList[midpoint:])
        return merge(leftSubList, rightSubList)


myNumbers = [2, 4, 5, 6, 0, 1, 11, 33]
print(splitAndMerge(myNumbers))