1.冒泡排序(Swift)

Swift语言

//OC的冒泡排序算法
func BubbleSort(array: inout Array<Any>, sortClosure:(Any,Any)->Bool) -> Array<Any> {
    //冒泡排序
    for indexI in array.indices {
        //最后一个元素直接返回
        if indexI == array.count-1 {
            break
        }
        
        //冒泡排序
        let m = array.count-1-indexI-1
        for indexJ in 0...m{
            //调用传递进来的闭包算法
            if sortClosure(array[indexJ],array[indexJ+1]){
            }else{
                //进行元素交换
                array.swapAt(indexJ, indexJ+1)
            }
        }
    }
        return array
}

• 测试验证：

var array:Array<Any> = [1,5,3,2,9,7,6,0]
BubbleSort(array: &array) {(i:Any, nextI:Any) -> Bool  in
    return (i as! Int) < (nextI as! Int)
}
print(array)
//打印[0, 1, 2, 3, 5, 6, 7, 9]