Untitled

def partition(array, low, high): 
    pivot = array[high]
    i = low - 1
 
    for j in range(low, high):
        if array[j] <= pivot:
            i = i + 1
            
            tmp = array[i]
            array[i] = array[j]
            array[j] = tmp
 
    tmp = array[i + 1]
    array[i + 1] = array[high]
    array[high] = tmp
    return i + 1
 
 
def quickSort(array, low, high):
    if low < high:
        pi = partition(array, low, high)
        quickSort(array, low, pi - 1)
        quickSort(array, pi + 1, high)