# your code goes here
def qsort(L):
    if len(L) < 1 : return L
    print(L)
    L_plus = []
    L_minus = []
    pivot = len(L) // 2
    for e in L :
        if e > L[pivot]:
            L_plus += [e]
        if e < L[pivot]:
            L_minus += [e]
        else:
            continue
    return  qsort(L_minus)+ [L[pivot]] +qsort(L_plus)

L = [8, 5, 3, 7, 9, 2, 6]
print(qsort(L))