Selection sort algorithm

selection_sort.go

package main

import (
	"fmt"
	"math/rand"
	"time"
)

func main() {
	rand.Seed(time.Now().UnixNano())

	list := randomList(200)

	// Show the list before the sort.
	fmt.Println(list)

	list = selectionSort(list)

	// Show the sorted list.
	fmt.Println(list)
}

// Generate a list of 10 random numbers from 0 to the given size.
func randomList(size int) []int {
	var list = make([]int, size, size)
	for i := range list {
		list[i] = rand.Intn(size)
	}

	return list
}

func selectionSort(list []int) []int {
	for current := 0; current < len(list); current++ {
		minIndexFound := current

		// Skip the current element and consider the remaining of the list.
		for i := current + 1; i < len(list); i++ {
			if list[i] < list[minIndexFound] {
				minIndexFound = i
			}
		}

		// Swap the two values, the one in the 'current' index
		// with the one in the 'minIndexFound' index.
		list[current], list[minIndexFound] = list[minIndexFound], list[current]
	}

	return list
}

On an array of length n, it performs exactly (n-1) swap instructions and exactly (n^2-n)/2 comparisons.