Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void bucked_sort(int tab[], int rozmiar, int m) {
- vector<vector<int>> bucket(m);
- //unsigned int max = tab[0];
- //for (int j = 0; j < rozmiar; j++) {
- // if (tab[j] > max)
- // max = tab[j];
- // }
- //max++;
- for (int i = 0; i < rozmiar; i++) {
- //bucket[floor((tab[i]) / double(max)*m)].push_back(tab[i]);
- int ind = floor((tab[i]) / (double(m)*rozmiar));
- bucket[ind].push_back(tab[i]);
- }
- for (int i = 0; i < m; i++) {
- sort(bucket[i].begin(), bucket[i].end());
- }
- int w = 0;
- for (int i = 0; i < rozmiar; i++)
- {
- for (int j = 0; j < bucket[i].size(); j++)
- {
- tab[w++] = bucket[i][j];
- }
- }
- for (int i = 0; i < rozmiar; i++) {
- cout << tab[i] << " ";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement