Go BubbleSort

bubble_sort.go

package main

import (
	"log"
)

func main() {
	array := []int{}
	bubbleSort(&array)
	assert([]int{}, array)

	array = []int{1}
	bubbleSort(&array)
	assert([]int{1}, array)

	array = []int{1, 2}
	bubbleSort(&array)
	assert([]int{1, 2}, array)

	array = []int{3, 1, 2}
	bubbleSort(&array)
	assert([]int{1, 2, 3}, array)

	array = []int{3, 2, 1, 4}
	bubbleSort(&array)
	assert([]int{1, 2, 3, 4}, array)

}

func bubbleSort(arr *[]int) {
	if len(*arr) <= 1 {
		return
	}

	arrPtr := *arr
	swapped := true
	for swapped {
		swapped = false
		for i := range arrPtr[:len(arrPtr)-1] {
			if arrPtr[i] > arrPtr[i+1] {
				tmp := arrPtr[i]
				arrPtr[i] = arrPtr[i+1]
				arrPtr[i+1] = tmp
				swapped = true
			}
		}
	}

	return
}

func assert(expected, actual []int) {
	if len(expected) != len(actual) {
		log.Panicf("%s != %s", expected, actual)
	}
	for x := range expected {
		if expected[x] != actual[x] {
			log.Panicf("%s != %s", expected, actual)
		}
	}
}