Added Bin Sort [Go]

README.md

@@ -18,7 +18,7 @@ Community (college) maintained list of Algorithms and Data Structures implementa
 
 | Algorithm | C | CPP | Java | Python | Golang | JavaScript | C# |
 |:--------------|:----------------:|:----------------:|:----------------:|:-----------------:|:-----------------:|:-----------------:| :-----------------:|
-| [Bin Sort](http://www.cdn.geeksforgeeks.org/bucket-sort-2/)| [:white_check_mark:](bin_sort/bin_sort.c) | |[:white_check_mark:](bin_sort/BinSort.java) | [:white_check_mark:](bin_sort/bin_sort.py) | | | |
+| [Bin Sort](http://www.cdn.geeksforgeeks.org/bucket-sort-2/)| [:white_check_mark:](bin_sort/bin_sort.c) | |[:white_check_mark:](bin_sort/BinSort.java) | [:white_check_mark:](bin_sort/bin_sort.py) | [:white_check_mark:](bin_sort/bin_sort.go) | | |
 | [Binary Search](https://en.wikipedia.org/wiki/Binary_search_algorithm) | [:white_check_mark:](binary_search/binary_search.c) | | [:white_check_mark:](binary_search/BinarySearch.java) | [:white_check_mark:](binary_search/binary_search.py) | [:white_check_mark:](binary_search/binary_search.go) | [:white_check_mark:](binary_search/binarySearch.js) | [:white_check_mark:](binary_search/BinarySearch.cs) |
 | [Breadth First Search](https://en.wikipedia.org/wiki/Breadth-first_search) | | | [:white_check_mark:](breadth_first_search/BreadthFirstSearch.java) | | | | |
 | [Coin Change Problem](http://www.algorithmist.com/index.php/Coin_Change) | [:white_check_mark:](coin_change_problem/coin_change_problem.c) | | [:white_check_mark:](coin_change_problem/CoinChangeProblem.java) | [:white_check_mark:](coin_change_problem/coin_change_problem.py) | [:white_check_mark:](coin_change_problem/coin_change_problem.go) | [:white_check_mark:](coin_change_problem/coinChangeProblem.js) | |

bin_sort/bin_sort.go

@@ -0,0 +1,65 @@
+package main
+
+import (
+	"fmt"
+	"math/rand"
+	"sort"
+)
+
+type Bucket []float32
+
+// Methods required to allow sorting bucket's content
+func (b Bucket) Len() int           { return len(b) }
+func (b Bucket) Swap(i, j int)      { b[i], b[j] = b[j], b[i] }
+func (b Bucket) Less(i, j int) bool { return b[i] < b[j] }
+
+// BucketSort sorts provided slice of floats using Bucket Sort algorithm
+// Time Complexity: O(n)-> Avg case and O(n^2)-> Worst Case
+// Constraints: 0 <= arr[i] <= 1
+func BucketSort(arr []float32) []float32 {
+	n := len(arr)
+
+	// Create n empty buckets, each can hold up to n elements
+	buckets := make([]Bucket, n)
+	for i := 0; i < n; i++ {
+		// Set length to 0, but allocate memory for n elements
+		buckets[i] = make([]float32, 0, n)
+	}
+
+	// Place all the elements into corresponding buckets
+	for i := 0; i < n; i++ {
+		bi := int(float32(n) * arr[i])
+		buckets[bi] = append(buckets[bi], arr[i])
+	}
+
+	// Sort elements in each bucket
+	for i := 0; i < n; i++ {
+		sort.Sort(buckets[i])
+	}
+
+	// Put sorted elements into the resulting array
+	sorted := make([]float32, 0, n)
+	for i := 0; i < n; i++ {
+		for j := 0; j < len(buckets[i]); j++ {
+			sorted = append(sorted, buckets[i][j])
+		}
+	}
+
+	return sorted
+}
+
+func makeRandomNumbers(n int) []float32 {
+	arr := make([]float32, n)
+	for i := range arr {
+		arr[i] = rand.Float32()
+	}
+
+	return arr
+}
+
+func main() {
+	n := 10
+	arr := makeRandomNumbers(n)
+	sorted := BucketSort(arr)
+	fmt.Println(sorted)
+}