From 4d8185f83eae1150e7c87affd7374d1997f09276 Mon Sep 17 00:00:00 2001
From: Sayantika Banik <sayantikabanik122@gmail.com>
Date: Fri, 29 Sep 2017 07:55:30 +0530
Subject: [PATCH] bucket sort code added

---
 Sorting/bucketSort.cpp | 42 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 Sorting/bucketSort.cpp

diff --git a/Sorting/bucketSort.cpp b/Sorting/bucketSort.cpp
new file mode 100644
index 000000000..278da92bd
--- /dev/null
+++ b/Sorting/bucketSort.cpp
@@ -0,0 +1,42 @@
+// C++ program to sort an array using bucket sort
+#include <iostream>
+#include <algorithm>
+#include <vector>
+using namespace std;
+ 
+// Function to sort arr[] of size n using bucket sort
+void bucketSort(float arr[], int n)
+{
+    // 1) Create n empty buckets
+    vector<float> b[n];
+    
+    // 2) Put array elements in different buckets
+    for (int i=0; i<n; i++)
+    {
+       int bi = n*arr[i]; // Index in bucket
+       b[bi].push_back(arr[i]);
+    }
+ 
+    // 3) Sort individual buckets
+    for (int i=0; i<n; i++)
+       sort(b[i].begin(), b[i].end());
+ 
+    // 4) Concatenate all buckets into arr[]
+    int index = 0;
+    for (int i = 0; i < n; i++)
+        for (int j = 0; j < b[i].size(); j++)
+          arr[index++] = b[i][j];
+}
+ 
+/* Driver program to test above funtion */
+int main()
+{
+    float arr[] = {0.897, 0.565, 0.656, 0.1234, 0.665, 0.3434};
+    int n = sizeof(arr)/sizeof(arr[0]);
+    bucketSort(arr, n);
+ 
+    cout << "Sorted array is \n";
+    for (int i=0; i<n; i++)
+       cout << arr[i] << " ";
+    return 0;
+}