swift实现排序算法
swift插入排序
func
insertionSort() {
var x,y,key : Int
for (x = 0 ;x < numberList . count ;x++) {
key = numberList [x]
for (y = x;y > - 1 ;y--) {
if (key < numberList [y]) {
numberList . removeAtIndex (y + 1 )
insert (key,atIndex: y)
}
}
}
var x,y,key : Int
for (x = 0 ;x < numberList . count ;x++) {
key = numberList [x]
for (y = x;y > - 1 ;y--) {
if (key < numberList [y]) {
numberList . removeAtIndex (y + 1 )
insert (key,atIndex: y)
}
}
}
}
冒泡排序
func
bubbleSort() {
Int
for x in 0 ..< numberList . count {
passes = ( count - 1 ) - x;
for y 0 ..<passes {
key = numberList [y]
if (key > numberList [y + 1 ]) {
z = 1 ]
1 ] = key
numberList [y] = z
}
}
}
Int
for x in 0 ..< numberList . count {
passes = ( count - 1 ) - x;
for y 0 ..<passes {
key = numberList [y]
if (key > numberList [y + 1 ]) {
z = 1 ]
1 ] = key
numberList [y] = z
}
}
}
}
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 [email protected] 举报，一经查实，本站将立刻删除。
