Sort algorithm with no condition in golang.

SleepSort.go

package main

import (
	"fmt"
	"time"
)

func sleepSort(tab []int) ([]int) {
	out := make([]int, len(tab))
	waiter := make(chan int, len(tab))
	ssort := func (i int) {
		time.Sleep(time.Nanosecond * time.Duration(i))
		waiter <- i
	}
	
	for _, i := range tab {
		go ssort(i)
	}
	for n, _ := range tab {
		out[n] = <-waiter
	}
	return out
}

func main() {
	res := sleepSort([]int{8, 42, 38, 111, 2, 39, 1})
	for _, n := range res {
		fmt.Println(n)
	}
}