python: quick sort

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

def quickSort(array, low, high):
    if low < high:
        pi = partition(array, low, high)
        quickSort(array, pi+1, high)
        quickSort(array, low, pi-1)