Sorting Algorithms

Bubble Sort

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
}

Merge Sort

package main 

import (
	"fmt"
)

func main(){
  fmt.Println("Merge Sort:")
  fmt.Println(mergeSort([]int{2,1,-3,0}))
  fmt.Println(mergeSort([]int{22,1111,-113,10,6}))
  fmt.Println(mergeSort([]int{212,16,-1,110,6}))
}

func mergeSort(arr []int)[]int{
	
	n := len(arr)

	if n == 1 {
		return arr
	}
	
	mid := int(n / 2)
	
	right := arr[0: mid]	
	left := arr[mid : n]
	
	return merge(mergeSort(right), mergeSort(left))
	
}

func merge(right[]int, left[]int) []int{
	sorted := make([]int, len(right) + len(left))
	
	i := 0
	for len(right) > 0  && len(left) > 0 {
		if right[0] < left[0]{
			sorted[i] = right[0]
			right = right[1:]
		}else {
			sorted[i] = left[0]
			left=left[1:]
		}
		i++
	}

	for j:= 0; j < len(right) ; j++ {
		sorted[i] =  right[j]
		i++
	}

	for j:= 0 ; j < len(left) ; j++ {
		sorted[i] = left[j]
		i++
	}

	return sorted
}

Insertion Sort

package main 

import (
	"fmt"
)

func main(){
	  fmt.Printf("Inerstion sort: %d", insertionSort([]int{2,3,-1,-4,9,1,2,0}))
}

// Take j and compare it with all the prevous elements
// We assume that the prevous eleemnts is the biggest elements in the list (ascdening)
func insertionSort(arr[]int)[]int{
	for i:= 1 ; i < len(arr) ; i++{
		j:=i
		for j > 0 && arr[j] < arr[j-1]{
			arr[j], arr[j-1] = arr[j-1], arr[j]
			j--
		}
	}

	return arr
}