forked from supershivam13/DataStructures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bucket Sort.cpp
60 lines (54 loc) · 1.18 KB
/
Bucket Sort.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
#include <iostream>
using namespace std;
void Insertionsort(int a[],int n)
{
for(int i=1;i<n;i++)
{
int key = a[i];
int j=i-1;
while(j>=0 && a[j]>key)
{
a[j+1]=a[j];
j--;
}
a[j+1] = key;
}
}
void BucketSort(int a[], int n, int k)
{
int max = 0;
for (int i = 0; i < n; i++)
if (max < a[i])
max = a[i];
max++;
int bucket[k][n];
int size[k] = {0};
for (int i = 0; i < n; i++)
{
int index = k * a[i] / max;
bucket[index][size[index]] = a[i];
size[index]++;
}
for (int i = 0; i < k; i++)
{
Insertionsort(bucket[i], size[i]);
}
for (int i = 0, j = 0; j < k; j++)
{
for (int l = 0; l < size[j]; l++)
a[i++] = bucket[j][l];
}
}
int main()
{
int n;
cout << "\nEnter No of elements in the array : ";
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) //input
cin >> arr[i];
BucketSort(arr, n, 5);
cout << "\nSorted Array : ";
for (int i = 0; i < n; i++) //output
cout << arr[i] << " ";
}