Radix Sort implemented in C

Author: Udhay

Radix Sort.c

@@ -0,0 +1,45 @@
+#include<stdio.h>
+int get_max (int a[], int n){
+   int max = a[0] , i;
+   for (i = 1; i < n; i++)
+      if (a[i] > max)
+         max = a[i];
+   return max;
+}
+void radix_sort (int a[], int n){
+   int bucket[10][10], bucket_cnt[10];
+   int i, j, k, r, NOP = 0, divisor = 1, lar, pass;
+   lar = get_max (a, n);
+   while (lar > 0){
+      NOP++;
+      lar /= 10;
+   }
+   for (pass = 0; pass < NOP; pass++){
+      for (i = 0; i < 10; i++){
+         bucket_cnt[i] = 0;
+      }
+      for (i = 0; i < n; i++){
+         r = (a[i] / divisor) % 10;
+         bucket[r][bucket_cnt[r]] = a[i];
+         bucket_cnt[r] += 1;
+      }
+      i = 0;
+      for (k = 0; k < 10; k++){
+         for (j = 0; j < bucket_cnt[k]; j++){
+            a[i] = bucket[k][j];
+            i++;
+         }
+      }
+      divisor *= 10;
+   }
+}
+int main (){
+   int i;
+   int a[7]={2,34,56,87,13,15,45};
+   radix_sort (a, 7);
+   printf ("Sorted Array : ");
+   for (i = 0; i < 7; i++)
+      printf ("%d ", a[i]);
+   printf ("\n");
+   return 0;
+}