-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathradix_sort.c
More file actions
49 lines (46 loc) · 890 Bytes
/
radix_sort.c
File metadata and controls
49 lines (46 loc) · 890 Bytes
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
// program Radix Sort . Cant sort -ve numbers
#include <stdio.h>
void count_sort(int Array[] , int n, int exp)
{
int temp[10] = {0};
int output[n];
for(int i=0;i<n;i++)
{
temp[(Array[i]/exp) %10]++;
}
for(int i=1;i<10;i++)
{
temp[i] = temp[i] + temp[i-1];
}
for(int i=n-1;i>=0;i--)
{
output[temp[(Array[i]/exp) %10] -1] = Array[i];
temp[(Array[i]/exp) %10]--;
}
for(int i=0;i<n;i++)
Array[i] = output[i];
}
void Radix_sort(int Array[] , int n)
{
int max = Array[0];
for(int i=0;i<n;i++)
if(Array[i] > max)
max = Array[i];
for (int exp = 1; max / exp > 0; exp *= 10)
count_sort(Array, n, exp);
}
void print_array(int Array[] , int n)
{
for(int i=0;i<n;i++)
printf("%d ",Array[i]);
}
int main()
{
int n; // length of Array;
scanf("%d",&n);
int Array[n];
for(int i=0;i<n;i++)
scanf("%d",&Array[i]);
Radix_sort(Array,n);
print_array(Array,n);
}