quicksort.py

def quick_sort(arr,start, end):
    if start < end:
        pivot = partition(arr, start, end)
        quick_sort(arr, start, pivot - 1)
        quick_sort(arr, pivot + 1, end)

def partition(arr, start, end):
    element = arr[start]
    i = start
    for j in range(start + 1, end):
        if arr[j] < element:
            i += 1
            arr[i], arr[j] = arr[j], arr[i]
    arr[start], arr[i] = arr[i], arr[start]
    return i