added radix sort to the deck of sorting algorithms

README.md

@@ -39,6 +39,7 @@ There are several data structures and algorithms implemented in this project. Th
 - Cocktail Sort
 - Gnome Sort
 - Merge Sort
+- Radix Sort
 
 ## Usage
 

RadixSort/RadixSort.go

@@ -0,0 +1,38 @@
+package RadixSort
+
+import (
+	"bytes"
+	"encoding/binary"
+)
+
+const digit = 4
+const maxbit = -1 << 31
+
+func RadixSort(data []int) {
+	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)
+		buf.Read(b)
+		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)
+		binary.Read(buf, binary.LittleEndian, &w)
+		data[i] = int(w^maxbit)
+	}
+}

RadixSort/RadixSort_test.go

@@ -0,0 +1,19 @@
+package RadixSort
+
+import (
+	"sort"
+	"testing"
+)
+
+func TestRadixSort(t *testing.T) {
+	array1 := []int{421, 15, -175, 90, -2, 214, -52, -166}
+	array2 := make(sort.IntSlice, len(array1))
+	copy(array2, array1)
+	RadixSort(array1)
+	array2.Sort()
+	for i := range array1 {
+		if array1[i] != array2[i] {
+			t.Fail()
+		}
+	}
+}