1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
/*
数组冒泡排序：[2,1,13,5,9]
==> [1 2 5 9 13]
*/
arr1 := [5]int{2, 1, 13, 5, 9}
fmt.Println(arr1[2])
//for i,_ := range arr1 {
// if i+1 < len(arr1) {
// if arr1[i] > arr1[i+1] {
// arr1[i], arr1[i+1] = arr1[i+1], arr1[i]
// }
// }
//}
for j:=0; j< len(nums)-1; j++ {
for i:=0; i < len(nums)-1-j; i++{
// len(nums)-1-j 后面排过序的就不需要再比较了
if nums[i] > nums[i+1] {
nums[i], nums[i+1] = nums[i+1], nums[i]
}
}
}
fmt.Println(arr1)
|