Question

How to implement the bubble sort algorithm in Go

Answer 1

package main

import (
    "fmt"
)

func bubblesort(slice []int) {
    var (
        n = len(slice)
        sorted = false
    )
    for !sorted {
        swap := false
        for i := 0; i < n-1; i++ {
            if slice[i] > slice[i+1] {
                slice[i+1], slice[i] = slice[i], slice[i+1]
                swap = true
            }
        }
        if !swap {
            sorted = true
        }
        n = n - 1
    }
}
  
func main() {
    slice := []int{5, 6, 3, 45, 99, 80, 7, 9} 
	
	fmt.Println(slice)
	
	bubblesort(slice);
    
	fmt.Println(slice)
}
 
 
 
/*
run:
 
[5 6 3 45 99 80 7 9]
[3 5 6 7 9 45 80 99]
 
*/

 

70+ SQL courses for beginners and professionals