quick-sort.py

from typing import List

def quick_sort(array: List, start: int, end: int) -> None:
    if start >= end:
        return

    pivot = partition(array, start, end)
    quick_sort(array, start, pivot - 1)
    quick_sort(array, pivot + 1, end)

def partition(array: List, start: int, end: int) -> int:
    pivot = start

    for i in range(start, end):
        if array[i] < array[end]:
            array[i], array[pivot] = array[pivot], array[i]
            pivot += 1

    array[pivot], array[end] = array[end], array[pivot]

    return pivot