Basic quicksort impl, inspired by http://me.dt.in.th/page/Quicksort/

quicksort.py

# Inspired by: http://me.dt.in.th/page/Quicksort/

def quicksort(l):

    if len(l) < 2:
        return l
    iSwap = 1
    pivot = l[0] # left most value is the pivot
    for i, val in enumerate(l[1:], start=1): # Skip the pivot cell
        if val < pivot:
            l[i], l[iSwap] = l[iSwap], l[i]
            iSwap += 1
    l[0], l[iSwap-1] = l[iSwap-1], l[0] # final swap

    # we need to go deeper (on the unsorted right and left halves)
    return quicksort(l[:iSwap-1]) + [l[iSwap-1]] + quicksort(l[iSwap:])