Quick Sort in Python

quick_sort.py

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

def sort(array, low, high):
    if low >= high:
        return
    
    pi = partition(array, low, high)
    
    sort(array, low, pi - 1)
    sort(array, pi + 1, high)
    
    return array
    

def quicksort(array):
    return sort(array, 0, len(array) - 1)