bubble_sort.go

package main

func BubbleSort(array []int) []int {
	if len(array) <= 1 {
		return array
	}

	for i := 0; i <= len(array)-1; i++ {
		for j := len(array) - 1; j > i; j-- {
			if array[j] < array[j-1] {
				temp := array[j]
				array[j] = array[j-1]
				array[j-1] = temp
			}
		}
	}

	return array
}

func OptimizedBubbleSort(array []int) []int {
	if len(array) <= 1 {
		return array
	}

	for i := 0; i <= len(array)-1; i++ {
		swapped := false
		for j := len(array) - 1; j > i; j-- {
			if array[j] < array[j-1] {
				temp := array[j]
				array[j] = array[j-1]
				array[j-1] = temp
				swapped = true
			}
		}

		if swapped == false {
			break
		}
	}

	return array
}