From 2fbd77e0fcca72af02cf17a6b4fc529202c9354c Mon Sep 17 00:00:00 2001
From: ShreyaK11 <106480495+ShreyaK11@users.noreply.github.com>
Date: Sat, 22 Oct 2022 00:28:47 +0530
Subject: [PATCH] Create Bucketsort.cpp

---
 C++/sorting_algorithms/Bucketsort.cpp | 45 +++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 C++/sorting_algorithms/Bucketsort.cpp

diff --git a/C++/sorting_algorithms/Bucketsort.cpp b/C++/sorting_algorithms/Bucketsort.cpp
new file mode 100644
index 0000000..1710ae4
--- /dev/null
+++ b/C++/sorting_algorithms/Bucketsort.cpp
@@ -0,0 +1,45 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+using namespace std;
+
+void print_array(float *A , int n)
+{
+    for(int i=0; i < n; i++)
+    {
+        cout<<A[i]<<endl;
+    }
+    cout<<"\n";
+}
+void bucketSort(float arr[],int n)
+{
+    vector<float>b[n];
+    for(int i=0 ; i < n;i++)
+    {
+        int bi=n*arr[i];
+        b[bi].push_back(arr[i]);
+    }
+    for(int i=0; i < n; i++)
+    {
+        sort(b[i].begin() , b[i].end());
+    }
+    int index=0;
+    for(int i=0; i < n; i++)
+    {
+        for(int j=0; j < b[i].size(); j++)
+        {
+            arr[index++]=b[i][j];
+        }
+    }
+}
+int main()
+{
+    float arr[]={0.89 , 0.67 ,0.123 , 0.6543,0.76,0.5,0.34,0.56};
+    int n=sizeof(arr)/sizeof(arr[0]);
+    cout<<"Array before sorting "<<endl;
+    print_array(arr,n);
+    cout<<"Array after sorting "<<endl;
+    bucketSort(arr,n);
+    print_array(arr,n);
+    return 0;
+}