Implementation of Bubble Sort in Go

bubbleSort.go

func bubbleSort(A []int) []int {
	for i := 1; i < len(A); i++ {
		for j := len(A) - 1; j >= i; j-- {
			if A[j-1] > A[j] {
				A[j-1], A[j] = A[j], A[j-1]
			}
		}

	}
	return A
}