View difference between Paste ID: nyD4ZTCX and 9deBe8sw

 // C++ program to sort an array using bucket sort
 #include <algorithm>
 #include <iostream>
 #include <vector>
 using namespace std;
 
 void sortowanie_kubelkowe(float tab[], int n)
-// Function to sort arr[] of size n using bucket sort
+
-void bucketSort(float arr[], int n)
+    // 1)
     vector<float> kub[n];
-    // 1) Create n empty buckets
+
-    vector<float> b[n];
+    // 2)
     for (int i = 0; i < n; i++) {
-    // 2) Put array elements in different buckets
+        int i_kub = n * tab[i];
         kub[i_kub].push_back(tab[i]);
-        int bi = n * arr[i]; // Index in bucket
+
-        b[bi].push_back(arr[i]);
+
     // 3)
     for (int i = 0; i < n; i++)
-    // 3) Sort individual buckets
+        sort(kub[i].begin(), kub[i].end());
 
-        sort(b[i].begin(), b[i].end());
+    // 4)
     int index = 0;
-    // 4) Concatenate all buckets into arr[]
+
         for (int j = 0; j < kub[i].size(); j++)
             tab[index++] = kub[i][j];
-        for (int j = 0; j < b[i].size(); j++)
+
-            arr[index++] = b[i][j];
+
 int main()
 {
-/* Driver program to test above function */
+    float tab[] = { 0.257, 0.1064, 0.598, 0.9876, 0.123, 0.456, 0.789 };
     int n = sizeof(tab) / sizeof(tab[0]);
     sortowanie_kubelkowe(tab, n);
-    float arr[] = { 0.897, 0.565, 0.656, 0.1234, 0.665, 0.3434 };
+
-    int n = sizeof(arr) / sizeof(arr[0]);
+    cout << "Posortowana tablica: \n";
-    bucketSort(arr, n);
+
         cout << tab[i] << " ";
-    cout << "Sorted array is \n";
+
 }
-        cout << arr[i] << " ";
+