AlgorithmsQuickSort

QuickSort.swift

func quickSort(nums: [Int]) -> [Int] {
    if nums.count < 2 {
        return nums
    } else  {
        let pivot = nums[0]
        
        var lessPart: [Int] = []
        var greaterPart: [Int] = []
        
        for i in 1..<nums.count {
            if nums[i] <= pivot {
                lessPart.append(nums[i])
            } else {
                greaterPart.append(nums[i])
            }
        }
        
        return quickSort(nums: lessPart) + [pivot] + quickSort(nums: greaterPart)
    }
}