Sort an Array Using Bubble Sort in Go

Definition: Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order.

Examples

Input arr = [7, 5, 1, 6, 3]

• 1^st iteration => swap(7, 5) => swap(7, 1) => swap(7, 6) => swap(7, 3) => [5, 1, 6, 3, 7]
• 2^nd iteration => [1, 5, 3, 6, 7]
• 3^rd iteration => [1, 3, 5, 6, 7]
• 4^th iteration => [1, 3, 5, 6, 7]
• 5^th iteration => [1, 3, 5, 6, 7]

Approach to solve this problem

Step 1: Iterate the array from 0^th index to n-1.

Step 2: Iterate the array from the 0^th index to n-1-i, where i is the index of the above loop.

Step 3: Swap if the highest element is at the starting position of an array, else leave.

Step 3: At the end, return the array.

Time Complexity: O(n²)

Program

Live Demo

package main
import "fmt"
func bubbleSort(arr []int) []int{

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

Output

[0 1 2 5 6]
[2 3 4 5 6]
[1 2 3 4 5]