Function mergeSort

Python/all sorting methods.py:110–116

(customList, l, r)

def mergeSort(customList, l, r):
    if l < r:
        m = (l+(r-1))//2
        mergeSort(customList, l, m)                   #T(n/2)
        mergeSort(customList, m+1, r)                 #T(n/2)
        merge(customList, l, m, r)
    return customList

# cList=[2,1,3,6,9,7,4,8,5]
# print(mergeSort(cList ,0 ,8))