GO-冒泡排序

// bubble sort
package main

import (
    "fmt"
)

func main() {
    nums := []int{1,2,4,6,3,1,7,3,12,5}
    nums = BubbleSort(nums)
    fmt.Println(nums)
    
    nums = []int{1,2,4,6,3,1,7,3,12,5}
    nums = BubbleSortV2(nums)
    fmt.Println(nums)
}

func BubbleSort(nums []int) []int {
    var numsCount = len(nums)
    for i:=0; i<numsCount-1; i++ {
        for j:=0; j<numsCount-i-1; j++ {
            if nums[j] > nums[j+1] {
                nums[j], nums[j+1] = nums[j+1], nums[j]
            }
        }
    }
    return nums
}

func BubbleSortV2(nums []int) []int {
    var numsCount = len(nums)
    for i:=0; i<numsCount-1; i++ {
        var isSorted = false
        for j:=0; j<numsCount-i-1; j++ {
            if nums[j] > nums[j+1] {
                nums[j], nums[j+1] = nums[j+1], nums[j]
                isSorted = true
            }
        }
        if !isSorted {break}
    }
    return nums
}