qsort

quicksort.py

a = [12,545,2,67,12,89,234,76,1,0,90]


def partition(arr, l, r):
    x = arr[r]
    i = l
    for j in range(l, r):
        if arr[j] <= x:
            arr[i], arr[j] = arr[j], arr[i]
            i += 1
    arr[i], arr[r] = arr[r], arr[i]

    return i

def qsort(array, left, right):
    if left < right:
        q = partition(array, left, right)
        qsort(array, left, q - 1)
        qsort(array, q + 1, right)
    return array


print(qsort(a, 0, len(a)-1))