選擇排序（Selection Sort）會在在未排序序列中找到最泄佳颉（大）元素，存放到排序序列的起始位置，然后繼續(xù)以上過程幸乒，直至所有的元素排序完畢，代碼實現(xiàn):
func selectionSort(inout arr: Array<NSInteger>) {
for i in 0.stride(to: arr.count-1, by: 1) {
var minIndex = i
for j in (i+1).stride(to: arr.count, by: 1) {
if arr[j] < arr[minIndex] {
minIndex = j
}
}
let temp = arr[minIndex]
arr[minIndex] = arr[i]
arr[i] = temp
}
}
var data = [3,8,10,2,9,5,1,100]
selectionSort(&data)
print("\(data)")
方案2
func sort(arr:inout [Int]) {
let count:Int = arr.count
for i in 0..<count {
var minIndex:Int = i
for j in i..<count {
if arr[minIndex] > arr[j] {
minIndex = j
}
}
if i != minIndex {
swap(&arr[i], &arr[minIndex])
}
}
}
