Golang : Bubble sort example

Example for Bubble sort algorithm implementation in Golang. Bubble sort a.k.a sinking sort, is a simple sorting algorithm that repeatedly steps through the elements in an array to be sorted, compares each pair of adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until no more swaps are needed.

 package main

 import (
  "fmt"
 )

 func bubbleSort(tosort []int) {
  size := len(tosort)
  if size < 2 {
 return
  }
  for i := 0; i < size; i++ {
 for j := size - 1; j >= i+1; j-- {
 if tosort[j] < tosort[j-1] {
 tosort[j], tosort[j-1] = tosort[j-1], tosort[j]
 }
 }
  }
 }

 func main() {
  unsorted := []int{1, 199, 3, 2, 5, 80, 99, 500}
  
  fmt.Println("Before : ", unsorted)
  
  bubbleSort(unsorted)
  
  fmt.Println("After : ", unsorted)
 }

Output :

Before : [1 199 3 2 5 80 99 500]

After : [1 2 3 5 80 99 199 500]