Function quickSort

Python/all sorting methods.py:135–140

(customList ,low ,high)

    return (i+1)

def quickSort(customList ,low ,high):
    if low < high:
        pi = partition(customList ,low ,high)                    #O(n)
        quickSort(customList ,low ,pi-1)                         #T(n/2)
        quickSort(customList ,pi+1 ,high)                        #T(n/2)
                                                            #combined = O(N LogN)

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