Quicksort

quicksort.py

#! /usr/bin/env python

def quicksort(list):
    # Base case: single element list is sorted.
    if list == []:
        return list

    pivot = list[0]
    left = quicksort([i for i in list[1:] if i < pivot])
    right = quicksort([i for i in list[1:] if i >= pivot])
    return left + [pivot] + right