Bubble sort algorithm

bubble.go

package main

import (
	"fmt"
)

func main() {

	unordered := []int{99, 6, 5, 88, 3, 9, 7, 11}
	ordered := bubbleSort(unordered)
	fmt.Println(unordered)
	fmt.Println(ordered)
}

func bubbleSort(numbers []int) []int {
	length := len(numbers)

	for i := 0; i < length; i++ {
		for j := 0; j < length; j++ {
			if j+1 <= length-1 && numbers[j] > numbers[j+1] {
				temp := numbers[j]
				numbers[j] = numbers[j+1]
				numbers[j+1] = temp
			}
		}
	}
	return numbers
}