Golang Sorting algorithm

This is a creation in Article, where the information may have evolved or changed.

Golang implementation of basic sorting algorithm

Bubblesort

func BubbleSort(data []int) {    fmt.Println("BubbleSort")    fmt.Printf("Source Data:%d\n", data)    for i := 0; i < len(data); i++ {        for j := 0; j < len(data)-i-1; j++ {            if data[j] > data[j+1] {                data[j], data[j+1] = data[j+1], data[j]            }        }        fmt.Printf("Middle Data:%2d=>%d\n", i, data)    }    fmt.Printf("Result Data:%d\n", data)}

Insertsort

func InsertSort(data []int) {    fmt.Println("InsertSort")    fmt.Printf("Source Data:%d\n", data)    for i := 1; i < len(data); i++ {        if data[i] < data[i-1] {            for j := i; j > 0; j-- {                if data[j] < data[j-1] {                    data[j-1], data[j] = data[j], data[j-1]                }            }        }        fmt.Printf("Middle Data:%2d=>%d\n", i, data)    }    fmt.Printf("Result Data:%d\n", data)}

Selectsort

func SelectSort(data []int) {    fmt.Println("SelectSort")    fmt.Printf("Source Data:%d\n", data)    for i := 0; i < len(data); i++ {        for j := i + 1; j < len(data); j++ {            if data[i] > data[j] {                data[j], data[i] = data[i], data[j]            }        }        fmt.Printf("Middle Data:%2d=>%d\n", i, data)    }    fmt.Printf("Result Data:%d\n", data)}