def mergeSort(myList):
    print (myList)
    if len(myList)<2:
        return myList[:]
    else:
        midPoint=len(myList)//2
        leftPart=mergeSort(myList[:midPoint])
        rightPart=mergeSort(myList[midPoint:])
        together=merge(leftPart,rightPart)
        print("Merge point",together)
        return together

def merge(leftPart,rightPart):
    result=[]
    #ordered lists starting indices
    i=0
    j=0
    while (i<len(leftPart) and j<len(leftPart)):
        if leftPart[i] <= rightPart[j]:
            result.append(leftPart[i])
            i = i+1
        else:
            result.append(rightPart[j])
            j=j+1
    while (i<len(leftPart)):
        result.append(leftPart[i])
        i=i+1
    while (j<len(rightPart)):
        result.append(rightPart[j])
        j=j+1
    return result