Sortowanie kubełkowe

// 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)
{
    // 1)
    vector<float> kub[n];

    // 2)
    for (int i = 0; i < n; i++) {
        int i_kub = n * tab[i];
        kub[i_kub].push_back(tab[i]);
    }

    // 3)
    for (int i = 0; i < n; i++)
        sort(kub[i].begin(), kub[i].end());

    // 4)
    int index = 0;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < kub[i].size(); j++)
            tab[index++] = kub[i][j];
}

int main()
{
    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);

    cout << "Posortowana tablica: \n";
    for (int i = 0; i < n; i++)
        cout << tab[i] << " ";
    return 0;
}