병합 정렬 (Merge Sorting)

import Foundation var inp = [23, 3, 45, 7, 6, 11, 14, 12, 9] func mergeSort(L: [T]) -> [T] { if L.count == 2 { if L[0] <= L[1] { print([L[0], L[1]]) return [L[0], L[1]] } else { print([L[1], L[0]]) return [L[1], L[0]] } } else if L.count == 1 { return L } else { var middle = L.count / 2 var left = mergeSort(L: Array(L[0..
(left: [T], right: [T]) -> [T]...