Swift 使用哪种通用排序算法它在排序数据上表现不佳

使用的通用排序算法

swift
func mergeSort(_ array: [T]) -> [T] {
    guard array.count > 1 else {
        return array
    }
    
    let midIndex = array.count / 2
    let leftArray = mergeSort(Array(array[..    let rightArray = mergeSort(Array(array[midIndex...]))
    
    return merge(leftArray, rightArray)
}
func merge(_ leftArray: [T], _ rightArray: [T]) -> [T] {
    var leftIndex = 0
    var rightIndex = 0
    var mergedArray: [T] = []
    
    while leftIndex < leftArray.count && rightIndex < rightArray.count {
        if leftArray[leftIndex] < rightArray[rightIndex] {
            mergedArray.append(leftArray[leftIndex])
            leftIndex += 1
        } else {
            mergedArray.append(rightArray[rightIndex])
            rightIndex += 1
        }
    }
    
    return mergedArray + Array(leftArray[leftIndex...]) + Array(rightArray[rightIndex...])
}
let unsortedArray = [5, 3, 8, 2, 1, 9, 4, 7, 6]
let sortedArray = mergeSort(unsortedArray)
print(sortedArray)  // 输出 [1, 2, 3, 4, 5, 6, 7, 8, 9]