如何计算插入排序和冒泡排序中的比较次数和交换次数？(Swift)

func insertionSort(_ array: inout [Int]) {
    var comparisons = 0
    var swaps = 0
    
    for i in 1..<array.count {
        let key = array[i]
        var j = i - 1
        
        while j >= 0 && array[j] > key {
            array[j + 1] = array[j]
            j -= 1
            comparisons += 1
            swaps += 1
        }
        
        array[j + 1] = key
        comparisons += 1
    }
    
    print("插入排序比较次数：\(comparisons)")
    print("插入排序交换次数：\(swaps)")
}

func bubbleSort(_ array: inout [Int]) {
    var comparisons = 0
    var swaps = 0
    
    for i in 0..<array.count {
        for j in 0..<(array.count - i - 1) {
            if array[j] > array[j + 1] {
                array.swapAt(j, j + 1)
                swaps += 1
            }
            comparisons += 1
        }
    }
    
    print("冒泡排序比较次数：\(comparisons)")
    print("冒泡排序交换次数：\(swaps)")
}