-
Notifications
You must be signed in to change notification settings - Fork 0
/
bucketsort.cpp
62 lines (51 loc) · 1.38 KB
/
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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <bits/stdc++.h>
using namespace std;
void bucketSort(int data[], int len)
{
//find minx max value of the array data
int min = data[0];
int max = min;
for(int i = 1; i < len; i++)
{
if(data[i] < min)
min = data[i];
if(data[i] > max)
max = data[i];
}
//get the bucket counts;
int bucketCounts = (max-min)/len + 1;
vector<vector<int>> bucketArrays;
for(int i = 0; i < bucketCounts; i++)
{
//position 0 used to keep the data count store in this bucket
vector<int> bucket;
bucketArrays.push_back(bucket);
}
//assign each value to bucket arrays.
for(int j = 0; j < len; j++)
{
int num = (data[j]-min)/len;
bucketArrays[num].push_back(data[j]);
}
//sort each bucket
for(int i = 0; i < bucketCounts; i++)
{
sort(bucketArrays[i].begin(),bucketArrays[i].end());
}
int index = 0;
//collect value from radix arrays to data
for(int k = 0; k < bucketCounts; k++)
{
for(int s = 0; s < bucketArrays[k].size(); s++)
{
data[index++] = bucketArrays[k][s];
}
}
}
int main() {
int arr[10] = {18,11,28,45,23,50};
bucketSort(arr, 6);
for(int i = 0; i < 6; i++)
cout << arr[i] << endl;
return 0;
}