Swift QuickSort example

Quicksort.swift

func qs(_ list: [Int]) -> [Int] {
    if list.count < 1 { return list }
    
    let pivot = list[list.count-1]
    var l = [Int]()
    var e = [Int]()
    var r = [Int]()
    
    for x in list {
        if x <  pivot { l.append(x) }
        if x == pivot { e.append(x) }
        if x >  pivot { r.append(x) }
    }
    
    return qs(l) + e + qs(r)
}

It lacks some optimization, but the ideia is there