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