Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<limits.h>
- void countSort(int arr[],int n,int exp) {
- int count[10];
- int output[n];
- for(int i=0;i<10;i++) count[i]=0;
- for(int i=0;i<n;i++) {
- count[(arr[i]/exp)%10]++;
- }
- for(int i=1;i<10;i++) {
- count[i]+=count[i-1];
- }
- for(int i=n-1;i>=0;i--) {
- count[(arr[i]/exp)%10]--;
- output[count[(arr[i]/exp)%10]] = arr[i];
- }
- for(int i=0;i<n;i++) {
- arr[i] = output[i];
- }
- }
- void radixSort(int arr[],int n) {
- int maxi=INT_MIN;
- for(int i=0;i<n;i++) {
- if(arr[i]>maxi) maxi=arr[i];
- }
- for(int exp=1;(maxi/exp)!=0;exp*=10) {
- countSort(arr,n,exp);
- }
- }
- int main () {
- int n; scanf("%d",&n);
- int a[n];
- for(int i=0;i<n;i++) {
- scanf("%d",(a+i));
- }
- radixSort(a,n);
- for(int i=0;i<n;i++) {
- printf("%d ",a[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment