Search⌘ K
Home
Courses
The Way to Go

Solution Review: Bubble Sort the Slice

Explore how to implement bubble sort on a Go slice by iterating through elements, comparing adjacent values, and swapping them as needed. Learn how multiple passes ensure the slice is sorted efficiently. This lesson prepares you to apply sorting algorithms to Go data structures effectively.

We'll cover the following...
Go (1.6.2)
package main
import (
	"fmt"
)
func main() {
	sla := []int{2, 6, 4, -10, 8, 89, 12, 68, -45, 37}
	fmt.Println("before sort: ",sla)
	// sla is passed via call by value, but since sla is a reference type
	// the underlying array is changed (sorted)
	bubbleSort(sla)
	fmt.Println("after sort:  ",sla)
}
func bubbleSort(sl []int) {
	// passes through the slice:
	for pass:=1; pass < len(sl); pass++ {
		// one pass:
		for i:=0; i < len(sl) - pass; i++ {		// the bigger value 'bubbles up' to the last position 
			if sl[i] > sl[i+1] {
				sl[i], sl[i+1] = sl[i+1], sl[i]
			}
		}
	}
}

In the program above, in main at line 7, we make a slice sla of integers and assign random integers to it in an unsorted manner. Now, at line 11, we call the function bubbleSort and pass sla to it. Look at the header for bubbleSort at line 15, it ...