-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRadix.cpp
49 lines (47 loc) · 1.19 KB
/
Radix.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
#include <iostream>
using namespace std;
int getMax(int array[], int n) {
int max = array[0];
for (int i = 1; i < n; i++)
if (array[i] > max)
max = array[i];
return max;
}
void countingSort(int array[], int size, int pos) {
const int max = 10;
int output[size];
int count[max];
for (int i = 0; i < max; ++i)
count[i] = 0;
for (int i = 0; i < size; i++)
count[(array[i] / place) % 10]++;
for (int i = 1; i < max; i++)
count[i] += count[i - 1];
for (int i = size - 1; i >= 0; i--) {
output[count[(array[i] / place) % 10] - 1] = array[i];
count[(array[i] / place) % 10]--;
}
for (int i = 0; i < size; i++)
array[i] = output[i];
}
void radixsort(int array[], int size) {
int max = getMax(array, size);
for (int pos = 1; max / pos > 0; pos *= 10)
countingSort(array, size, place);
}
void printArray(int array[], int size) {
for (int i = 0; i < size; i++)
cout << array[i] << " ";
}
int main() {
int arr[50],n;
cout<<"Enter the size of array : \n";
cin>>n;
cout<<"Enter the array element : \n";
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
radixsort(arr, n);
printArray(arr, n);
}