-
Notifications
You must be signed in to change notification settings - Fork 48
/
Bucketsort.cpp
37 lines (32 loc) · 735 Bytes
/
Bucketsort.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <iostream>
#include <algorithm>
#include <vector> //used for the sake of simplicity of understanding the sorting algorithm
using namespace std;
void bucketSort(float arr[], int n)
{
vector<float> b[n];
for (int i=0; i<n; i++)
{
int x = n*arr[i];
b[x].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];
}
void main()
{
int n;
cin>>n;
float arr[n];
for (int i=0; i<n; i++){
cin>> arr[i];
}
bucketSort(arr, n);
cout << "\nAfter Sorting \n";
for (int i=0; i<n; i++)
cout << arr[i] << " ";
}