冒泡排序与选择排序

GO： 冒泡排序 和 选择排序

package main

import ("fmt")

//将每一个与所有对比一遍
func selectionSort(array []int) {

    if len(array) <= 1 {        
    	return
    }
    
    for i := 0; i < len(array)-1; i++ {

        for j := i + 1; j < len(array); j++ {
        
            if array[i] > array[j] {               
             	array[j], array[i] = array[i], array[j]
             }
        }
    }
}

//相邻的两个数据对比
func bubbleSort(s []int) {

    if len(s) <= 1 {        
    	return
     }
     
    for i := 0; i < len(s)-1; i++ {
    
        for j := 0; j < len(s)-i-1; j++ {
        
            if s[j] > s[j+1] {                
            	s[j], s[j+1] = s[j+1], s[j]
            }        
        }
    }
 }
 
func main() {
    var b = []int{8, 3, 5, 2, 7, 1, 6, 0, 10, 9, 4}    
    bubbleSort(b)
    fmt.Printf("bubbleSort:%d\n", b)
    
    var s = []int{8, 3, 5, 2, 7, 1, 6, 0, 10, 9, 4
    selectionSort(s)    
    fmt.Printf("selectionSort:%d\n", s)
}