Adding BucketSort

Author: bhavnavarshney

Go/sorting/bucketsort.go

@@ -0,0 +1,44 @@
+/*
+Bucket sort is mainly useful when input is uniformly distributed over a range. (Floating point nos)
+*/
+
+package sorting
+
+func BucketSort(arr []float64) {
+	n := len(arr)
+	noOfBuckets := 10.0
+	bucket := make([][]float64, 10)
+
+	//Step 1 : Put the elements into their respective bucket by multiplying it with 10. Each bucket of size 0.1
+	for i := 0; i < n; i++ {
+		bucketNo := int(arr[i] * noOfBuckets)
+		bucket[bucketNo] = append(bucket[bucketNo], arr[i])
+	}
+
+	//Step 2: Insertion sort on each bucket
+	for i := 0; i < 10; i++ {
+		insertionSortFloat(bucket[i], len(bucket[i]))
+	}
+
+	pointer := 0
+	for bucketNo := 0; bucketNo < 10; bucketNo++ {
+		for index := 0; index < len(bucket[bucketNo]); index++ {
+			arr[pointer] = bucket[bucketNo][index]
+			pointer++
+		}
+	}
+}
+
+func insertionSortFloat(arr []float64, n int) {
+	for i := 1; i < n; i++ {
+		hole := arr[i]
+		j := i
+
+		for j > 0 && hole < arr[j-1] {
+			arr[j] = arr[j-1]
+			j--
+		}
+
+		arr[j] = hole
+	}
+}

Go/sorting/bucketsort_test.go

@@ -0,0 +1,37 @@
+/*
+Bucket sort is mainly useful when input is uniformly distributed over a range. (Floating point nos)
+*/
+
+package sorting
+
+import (
+	"reflect"
+	"testing"
+)
+
+func TestBucketSort(t *testing.T) {
+	type args struct {
+		arr []float64
+	}
+	tests := []struct {
+		name string
+		args args
+		want []float64
+	}{
+		{
+			name: "test-01",
+			args: args{
+				arr: []float64{0.897, 0.565, 0.656, 0.1234, 0.665, 0.3434},
+			},
+			want: []float64{0.1234, 0.3434, 0.565, 0.656, 0.665, 0.897},
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			BucketSort(tt.args.arr)
+			if !reflect.DeepEqual(tt.args.arr, tt.want) {
+				t.Errorf("Got:%v but want:%v", tt.args.arr, tt.want)
+			}
+		})
+	}
+}