Performance-testing loop types in bubble sort algorithm in Go (for/each vs. while vs. infinite loops)

main.go

// simple sorting algorithms
package main

import "fmt"

func getNumbers() []int {
	return []int{12, 7, 256, 4, 22, 44, 55, 85, 56, 3, 6, 1, 98, 76}
}

func RangeLoopSort(arr []int) []int {
	for i := range arr {
		for j := range arr {
			if arr[i] < arr[j] {
				arr[i], arr[j] = arr[j], arr[i]
			}
		}
	}
	return arr
}

func ForEachLoopSort(arr []int) []int {
	for i := 1; i < len(arr); i++ {
		for j := 0; j < len(arr)-1; j++ {
			if arr[i] < arr[j] {
				arr[i], arr[j] = arr[j], arr[i]
			}
		}
	}
	return arr
}

func InfiniteLoopSort(arr []int) []int {
	var isSwapped bool
	isSwapped = true
	for isSwapped {
		isSwapped = false
		var i int
		for i = 1; i < len(arr); i++ {
			if arr[i-1] > arr[i] {
				var temp = arr[i]
				arr[i] = arr[i-1]
				arr[i-1] = temp
				isSwapped = true
			}
		}
	}
	return arr
}

func main() {
	arr := getNumbers()
	fmt.Printf("infinite loop: %v\n", ForEachLoopSort(arr))
	fmt.Printf("range loop: %v\n", RangeLoopSort(arr))
	fmt.Printf("for/each loop: %v\n", InfiniteLoopSort(arr))
}

main_test.go

package main

import "testing"

func BenchmarkRangeSort(b *testing.B) {
	// run the bubble sort algorithm b.N times
	for n := 0; n < b.N; n++ {
		RangeLoopSort(getNumbers())
	}
}
func BenchmarkForEachLoopSort(b *testing.B) {
	// run the bubble sort algorithm b.N times
	for n := 0; n < b.N; n++ {
		ForEachLoopSort(getNumbers())
	}
}
func BenchmarkInfiniteLoopSort(b *testing.B) {
	// run the swap sort algorithm b.N times
	for n := 0; n < b.N; n++ {
		InfiniteLoopSort(getNumbers())
	}
}