Insertion sort implemented with Go

insertionsort.go

func insertionSort(data []int) []int {
  for n := 1; n < len(data); n++ {
   v := data[n]   
   for k:=n - 1; k >= 0; k-- {
      if v < data[k] {
          // swap
          data[k+1] = data[k]
          data[k] = v
      } 
    }
  }
  return data;
}