冒泡排序，就是挨個(gè)遍歷然后比較，發(fā)現(xiàn)不符合排序規(guī)則，進(jìn)行交換，最終達(dá)到排序結(jié)果。
BubbleSort.swift如下：

//冒泡排序

var a = [6, 5, 4, 3, 2, 1]

print("array is \(a)")

//遍歷一遍數(shù)組
for i in 0...a.count-1 {
    //挨個(gè)比較其他數(shù)字
    for j in 0..<a.count-1-i {
        print("i is \(i) and j is \(j)")
        
        //如果右側(cè)數(shù)字比自己小，則交換，讓大的數(shù)字到右邊
        if a[j] > a[j+1] {
            print("change \(a[j]) and \(a[j+1])")
            
            let temp = a[j+1]
            a[j+1] = a[j]
            a[j] = temp
        }
    }
}

//排序結(jié)束
print("sorted array is \(a)")

Terminal運(yùn)行swift BubbleSort.swift可見：

array is [6, 5, 4, 3, 2, 1]
i is 0 and j is 0
change 6 and 5
i is 0 and j is 1
change 6 and 4
i is 0 and j is 2
change 6 and 3
i is 0 and j is 3
change 6 and 2
i is 0 and j is 4
change 6 and 1
i is 1 and j is 0
change 5 and 4
i is 1 and j is 1
change 5 and 3
i is 1 and j is 2
change 5 and 2
i is 1 and j is 3
change 5 and 1
i is 2 and j is 0
change 4 and 3
i is 2 and j is 1
change 4 and 2
i is 2 and j is 2
change 4 and 1
i is 3 and j is 0
change 3 and 2
i is 3 and j is 1
change 3 and 1
i is 4 and j is 0
change 2 and 1
sorted array is [1, 2, 3, 4, 5, 6]