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]
By Adam Ng
IF you gain some knowledge or the information here solved your programming problem. Please consider donating to the less fortunate or some charities that you like. Apart from donation, planting trees, volunteering or reducing your carbon footprint will be great too.
Advertisement
Tutorials
+10.7k Swift : Convert (cast) Float to String
+14.1k Golang : Get all local users and print out their home directory, description and group id
+24.9k Golang : Get executable name behind process ID example
+13k Golang : Get current time
+8.2k Golang : What is the default port number for connecting to MySQL/MariaDB database ?
+83.2k Golang : How to convert character to ASCII and back
+38.7k Golang : UDP client server read write example
+7.9k Golang : Sort lines of text example
+7k Golang : get the current working directory of a running program
+4.7k Javascript : Shuffle or randomize array example
+5.2k Golang : How to search a list of records or data structures