Simple and custom bubble sort in Go (GoLang).

bubblesort.go

package slice

// For learning purpose only.
// Please, use the sort package of Go's Standard library: https://pkg.go.dev/sort

// BubbleSort sorts the slice `vals` with the
// bubble sort algorithm.
// Time: O(n^2)
// Space: O(1)
func BubbleSort(vals []int) {
	// Time: O(n)
	for i := 1; i < len(vals); i++ {
		// Time: O(n)
		for j := 1; j < len(vals)-i+1; j++ {
			if vals[j-1] > vals[j] {
				vals[j-1], vals[j] = vals[j], vals[j-1]
			}
		}
	}
}

/*
As you can see with the previous answer, we started with i=1 and j=1 .
We can also start with i=0 and j=0:

// BubbleSort sorts the slice `vals` with the
// bubble sort algorithm.
// Time: O(n^2)
// Space: O(1)
func BubbleSort(vals []int) {
	// Time: O(n)
	for i := 0; i < len(vals)-1; i++ {
		// Time: O(n)
		for j := 0; j < len(vals)-i-1; j++ {
			if vals[j] > vals[j+1] {
				vals[j], vals[j+1] = vals[j+1], vals[j]
			}
		}
	}
}
*/