How to create a quicksort implementation in swift?

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15

func quicksort<T: Comparable>(_ array: [T]) -> [T] {
    guard array.count > 1 else { return array }
    
    let pivot = array[array.count / 2]
    let less = array.filter { $0 < pivot }
    let equal = array.filter { $0 == pivot }
    let greater = array.filter { $0 > pivot }
    
    return quicksort(less) + equal + quicksort(greater)
}

// Example usage
let array = [5, 2, 9, 3, 7, 1, 8, 6, 4]
let sortedArray = quicksort(array)
print(sortedArray) // [1, 2, 3, 4, 5, 6, 7, 8, 9]