Radix Sort Example for Go, taken from github.com/dgryski/go-radixsort

radixsort.go

func Ints(E []int) {

	// Algorithm from CLRS, chapter 8

	const m = 256
	n := len(E)

	counts := make([]int, m)

	src := E
	dst := make([]int, n)

	for i := uint(0); i < 8; i++ {
		shift := i * 8

		for i := range counts {
			counts[i] = 0
		}

		for i := 0; i < n; i++ {
			j := byte(src[i] >> shift)
			counts[j]++
		}

		for j := 1; j < m; j++ {
			counts[j] += counts[j-1]
		}

		for i := n - 1; i >= 0; i-- {
			j := byte(src[i] >> shift)
			dst[counts[j]-1] = src[i]
			counts[j]--
		}

		src, dst = dst, src
	}
}