Quick sort of Swift

qsort.swift

//: Playground - noun: a place where people can play

import UIKit

var randomNumbers = [42, 12, 88, 62, 63, 56, 1, 77, 88, 97, 97, 20, 45, 91, 62, 2, 15, 31, 59, 5]

func partition(inout v: [Int], left: Int, right: Int) -> Int {
    var i = left
    for j in (left + 1) ... right {
        if v[j] < v[left] {
            i += 1
            (v[i], v[j]) = (v[j], v[i])
        }
    }
    (v[i], v[left]) = (v[left], v[i])
    print(v)
    return i
}

func quicksort(inout v: [Int], left: Int, right: Int) {
    if right > left {
        let pivotIndex = partition(&v, left: left, right: right)
        quicksort(&v, left: left, right: pivotIndex - 1)
        quicksort(&v, left: pivotIndex + 1, right: right)
    }
}

quicksort(&randomNumbers, left: 0, right: randomNumbers.count-1)