Insertion Sort - Part 1 - https://www.hackerrank.com/challenges/insertionsort1

insertion-sort-1.go

package main

import (
	"bufio"
	"fmt"
	"log"
	"os"
	"strconv"
	"strings"
)

func main() {
	s := bufio.NewScanner(os.Stdin)
	var l [2]string
	var c int

	for s.Scan() {
		l[c] = s.Text()
		c++
	}

	if err := s.Err(); err != nil {
		log.Fatal(err)
	}

	size, err := strconv.Atoi(l[0])
	if err != nil {
		log.Fatal(err)
	}

	t := strings.Split(l[1], " ")
	var n []int

	for _, v := range t {
		i, err := strconv.Atoi(v)
		if err != nil {
			log.Fatal(err)
		}
		n = append(n, i)
	}

	for i := 1; i <= size-1; i++ {
		x := n[i]
		j := i
		for j > 0 && n[j-1] > x {
			n[j] = n[j-1]
			j = j - 1
			fmt.Printf("%s\n", arrayToString(n))
		}
		n[j] = x
	}
	fmt.Printf("%s\n", arrayToString(n))
}

func arrayToString(l []int) (s string) {
	for _, v := range l {
		s = s + strconv.Itoa(v) + " "
	}
	return
}