Quicksort translated from https://www.haskell.org/haskellwiki/Introduction#Quicksort_in_Haskell

gistfile1.swift

func curry<T,U,V>(f:(T,U)->V) -> T -> U -> V
{
    return {x in { y in f(x,y)}}
}

extension Array {
    var decompose : (T,[T])? {
        return (count > 0) ? (self[0], Array(self[1..<count])) : nil
    }
}

func quicksort(unsorted : [Int]) -> [Int]
{
    switch (unsorted.decompose) {
    case .Some(let head, let tail):
        return quicksort(filter(tail, curry(>)(head))) + [head] + quicksort(filter(tail,curry(<=)(head)))
    default:
        return []
    }
}


quicksort([2,1,4,0,1,4])