diff --git a/sorting/radixsort.c b/sorting/radixsort.c
index 8f274ede..6f0aa062 100644
--- a/sorting/radixsort.c
+++ b/sorting/radixsort.c
@@ -1,50 +1,83 @@
+//sorting of array list using Radix sort
 #include <stdio.h>
-#define range 10
 
-int MAX(int ar[], int size1){
-    int i, max1 = ar[0];
-    for(i = 0; i<size1; i++){
-        if(ar[i]>max1)
-            max1 = ar[i];
+#define range 10  // Range for integers is 10 as digits range from 0-9
+
+// Utility function to get the maximum value in ar[]
+int MAX(int ar[], int size){
+    int i, max = ar[0];
+    for(i = 0; i<size; i++){
+        if(ar[i]>max)
+            max = ar[i];
     }
-    return max1;
+    return max;
 }
 
-void countsort(int arr[],int n,int place)
+// Counting sort according to the digit represented by 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};         
         int output[n];
+    
+        // Store count of occurences in freq[]
         for(i=0;i<n;i++)
                 freq[(arr[i]/place)%range]++;
+    
+        // Change freq[i] so that it contains the actual position of the digit in output[]
         for(i=1;i<range;i++)
                 freq[i]+=freq[i-1];
+    
+        // Build the output array
         for(i=n-1;i>=0;i--)
         {
                 output[freq[(arr[i]/place)%range]-1]=arr[i];
                 freq[(arr[i]/place)%range]--;
         }
+        
+        // Copy the output array to arr[], so it contains numbers according to the current digit
         for(i=0;i<n;i++)
                 arr[i]=output[i];
 }
-void radixsort(int arr[],int n,int maxx)            //maxx is the maximum element in the array
+
+/*This is where the sorting of the array takes place
+ arr[] --- Array to be sorted
+ n --- Array Size
+ max --- Maximum element in Array
+ */
+void radixsort(int arr[],int n,int max)            //max is the maximum element in the array
 {
         int mul=1;
-        while(maxx)
+        while(max)
         {
                 countsort(arr,n,mul);
                 mul*=10;
-                maxx/=10;
+                max/=10;
         }
 }
 
-int main(){
-    int size = 8, ar[] = {1,3,2,7,6,4,3,12};
-    int max = MAX(ar, size);
-    radixsort(ar, size, max);
+int main(int argc, const char * argv[]){
+    int n;
+    printf("Enter size of array:\n");
+    scanf("%d", &n); // E.g. 8
+    
+    printf("Enter the elements of the array\n");
     int i;
-    for(i = 0; i<size; i++)
-        printf("%d ", ar[i]);
-
+    int arr[n];
+    for(i = 0; i < n; i++){
+        scanf("%d", &arr[i] );
+    }
+    
+    printf("Original array: ");
+    display(arr, n);                   // Original array : 10 11 9 8 4 7 3 8
+    
+    int max;
+    max = MAX(arr,n);
+    
+    radixsort(arr, n, max);
+    
+    printf("Sorted array: ");
+    display(arr, n);                // Sorted array : 3 4 7 8 8 9 10 11
+    
     return 0;