# Golang program for implementation of Radix Sort

Radix Sort is a clever and intuitive little sorting algorithm. Radix Sort puts the elements in order by comparing the digits of the numbers. Radix sort is an integer sorting algorithm that sorts data with integer keys by grouping the keys by individual digits that share the same significant position and value (place value). Radix sort uses counting sort as a subroutine to sort an array of numbers.
```// Radix Sort in Golang
package main

import (
"bytes"
"encoding/binary"
"fmt"
)

const digit = 4
const maxbit = -1 << 31

func main() {

var data = []int32{421, 15, -175, 90, -2, 214, -52, -166}
fmt.Println("\n--- Unsorted --- \n\n", data)
fmt.Println("\n--- Sorted ---\n\n", data, "\n")
}

buf := bytes.NewBuffer(nil)
ds := make([][]byte, len(data))
for i, e := range data {
binary.Write(buf, binary.LittleEndian, e^maxbit)
b := make([]byte, digit)
ds[i] = b
}
countingSort := make([][][]byte, 256)
for i := 0; i < digit; i++ {
for _, b := range ds {
countingSort[b[i]] = append(countingSort[b[i]], b)
}
j := 0
for k, bs := range countingSort {
copy(ds[j:], bs)
j += len(bs)
countingSort[k] = bs[:0]
}
}
var w int32
for i, b := range ds {
buf.Write(b)
data[i] = w^maxbit
}
}
```
C:\golang\time>go run sort.go

--- Unsorted ---

[421 15 -175 90 -2 214 -52 -166]

--- Sorted ---

[-175 -166 -52 -2 15 90 214 421]

C:\golang\time>