[Swift] Quick 정렬
시간 복잡도
- 평균 : O(nlog(n))
- 최악 : O(n^2)
Code
func quickSort(_ array: [Int]) -> [Int] {
guard let first = array.first, array.count > 1 else { return array }
let pivot = first
let left = array.filter { $0 < pivot }
let right = array.filter { $0 > pivot }
return quickSort(left) + [pivot] + quickSort(right)
}
댓글남기기