Bubble sort in go

bubble_sort.go

package main

import (
	"fmt"
)

/*
5
25, 17, 31, 13, 2

sorted array  [2 13 17 25 31]

Worst Case Time Complexity [ Big-O ]: O(n2)
Best Case Time Complexity [Big-omega]: O(n)
Average Time Complexity [Big-theta]: O(n2)
*/
func main() {
	var n int
	fmt.Println("enter the no of inputs")
	fmt.Scanln(&n)
	arr := make([]int, n)
	fmt.Println("enter the numbers >")
	for i := 0; i < n; i++ {
		fmt.Scan(&arr[i])
	}
	bubbleSort(&arr, 0, n-1)
	fmt.Println("sorted array ", arr)
}

func bubbleSort(a *[]int, s, e int) {
	arr := *a
	swapped := false
	for i := s; i < e; i++ {
		for j := s + 1; j <= e-i; j++ {
			if arr[j-1] > arr[j] {
				t := arr[j-1]
				arr[j-1] = arr[j]
				arr[j] = t
				swapped = true
			}
		}
		if !swapped {
			return
		}
	}
}