1.冒泡排序算法实现
//冒泡排序算法
func intBubbleSort( array:inout [Int])
{
let len = array.count
for i in 0..<len - 1
{
for j in 0..<(len - i - 1)
{
//进行交换,小数在前,大数在后
if array[j] > array[j + 1]
{
let tmp = array[j]
array[j] = array[j + 1]
array[j + 1] = tmp
}
}
}
}
2.算法调用
//算法调用
var myArr = [-2, 11, 20, 13, 9, -40, 23, -19, 34, 78, 10]
intBubbleSort(array:&myArr)
print(myArr)