diff --git a/guide/english/algorithms/sorting-algorithms/radix-sort/index.md b/guide/english/algorithms/sorting-algorithms/radix-sort/index.md index 7184387fd1..d917262c31 100644 --- a/guide/english/algorithms/sorting-algorithms/radix-sort/index.md +++ b/guide/english/algorithms/sorting-algorithms/radix-sort/index.md @@ -66,40 +66,38 @@ Finally , we sort according to the hundred's digit (most significant digit): The array becomes : 10, 11, 17, 21, 34, 44, 123, 654 which is sorted. This is how our algorithm works. An implementation in C: -``` +```c 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 output[n]; - int i,freq[range]={0}; //range for integers is 10 as digits range from 0-9 - int output[n]; - - for(i=0;i=0;i--){ - output[freq[(arr[i]/place)%range]-1]=arr[i]; - freq[(arr[i]/place)%range]--; - } - - for(i=0;i=0;i--){ + output[freq[(arr[i]/place)%range]-1]=arr[i]; + freq[(arr[i]/place)%range]--; + } + + for(i=0;i