Algo: Quick Sort

quick_sort.py

def partition (array, start, end):
    pivot = array[start]
    low = start + 1
    high = end
    
    while (low <= high):
        while (low <= end and array[low] <= pivot):
            low += 1
        while (high > start and array[high] > pivot):
            high -= 1
        if (low < high):
            array[low], array[high] = array[high], array[low]

    array[start], array[high] = array[high], array[start]
    return high


def quick_sort(array, start, end):
    if (start < end):
        p = partition(array, start, end)
        quick_sort(array, start, p - 1)
        quick_sort(array, p + 1, end)


# Main
quick_sort([2, 4, 3, 1, 5], 0, 4) # [1, 2, 3, 4, 5]