gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Minor grammatical corrections. (#31228)

Browse Source
This commit is contained in:
Himanshu Patel
2019-05-11 21:44:41 +05:30
committed by The Coding Aviator
parent e345970e51
commit 2ed6bc9831
1 changed files with 6 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
guide/english/algorithms/sorting-algorithms/radix-sort/index.md
View File

@ -70,45 +70,31 @@ An implementation in C:
void countsort(int arr[],int n,int place){ void countsort(int arr[],int n,int place){
int i,freq[range]={0}; //range for integers is 10 as digits range from 0-9 int i,freq[range]={0}; //range for integers is 10 as digits range from 0-9
int output[n]; int output[n];
for(i=0;i<n;i++) for(i=0;i<n;i++)
freq[(arr[i]/place)%range]++; freq[(arr[i]/place)%range]++;
for(i=1;i<range;i++) for(i=1;i<range;i++)
freq[i]+=freq[i-1]; freq[i]+=freq[i-1];
for(i=n-1;i>=0;i--){ for(i=n-1;i>=0;i--){
output[freq[(arr[i]/place)%range]-1]=arr[i]; output[freq[(arr[i]/place)%range]-1]=arr[i];
freq[(arr[i]/place)%range]--; freq[(arr[i]/place)%range]--;
} }
for(i=0;i<n;i++) for(i=0;i<n;i++)
arr[i]=output[i]; arr[i]=output[i];
} }
void radixsort(ll arr[],int n,int maxx){ //maxx is the maximum element in the array void radixsort(ll arr[],int n,int maxx){ //maxx is the maximum element in the array
int mul=1; int mul=1;
while(maxx){ while(maxx){
countsort(arr,n,mul); countsort(arr,n,mul);
mul*=10; mul*=10;
maxx/=10; maxx/=10;
} }
} }
``` ```