quick_sort.py

'''
Kyle C. Rosales
October 8, 2014
Quick Sort
'''
def quick_sort(ls):
    if len(ls) <= 1: return ls
    pivot_val = ls[0]
    less, equal, greater = [], [], []
    for i in ls:
        if i < pivot_val: less.append(i)
        elif i == pivot_val: equal.append(i)
        else: greater.append(i)
    return quick_sort(less) + equal + quick_sort(greater)