diff --git a/algorithms/C/README.md b/algorithms/C/README.md
index da034e96..6caf86ae 100644
--- a/algorithms/C/README.md
+++ b/algorithms/C/README.md
@@ -53,6 +53,7 @@
 - [Selection Sort](sorting/selection-sort.c)
 - [Quick Sort](sorting/quick-sort.c)
 - [Shell Sort](sorting/shell-sort.c)
+- [Radix Sort](sorting/radix-sort.c)
 
 ## Strings
 
diff --git a/algorithms/C/sorting/radix-sort.c b/algorithms/C/sorting/radix-sort.c
new file mode 100644
index 00000000..6a9e3069
--- /dev/null
+++ b/algorithms/C/sorting/radix-sort.c
@@ -0,0 +1,66 @@
+#include <stdio.h>
+
+
+int get_max( int arr[], int n){
+
+    int myMax = -1 ;
+    for(int i=0; i<n; i++){
+        if(arr[i] > myMax)myMax = arr[i] ;
+    }
+
+    return myMax ;
+}
+
+void count_sort(int arr[], int n, int digit){
+    int count[10] = {0} ;
+    int *sorted ;
+    sorted = (int*)malloc(n * sizeof(int));
+
+    for(int i=0; i<n; i++){
+        count[(arr[i]/digit)%10]++ ;
+    }
+    for(int i=1; i<10; i++){
+        count[i] += count[i-1] ;
+    }
+
+    for(int i=n-1; i>=0; i--){
+        sorted[--count[(arr[i]/digit)%10]] = arr[i] ;
+    }
+
+    for(int i=0; i<n; i++){
+        arr[i] = sorted[i] ;
+    }
+}
+
+void radix_sort(int arr[], int n){
+
+    int myMax = get_max(arr,n) ;
+
+    for(int digit=1; myMax/digit; digit*=10){
+        count_sort(arr,n,digit) ;
+    }
+}
+
+int main() {
+    //                  :  The best :  The avg : The worst  : Space 
+    //       complexity :    O(kn)  :   O(kn)  :  O(kn)     :  O(d+n)
+
+	//         Stability :   Inplace    :      Comparison Sort 
+        //          Yes      :     Yes      :       No 
+
+    int arr[] = {374, 42, 6, 920,825} ;
+    int n = sizeof(arr)/sizeof(int) ;
+
+    printf("Before sorting : ") ;
+    for(int i=0; i<n; i++){
+        printf("%d ",arr[i] );
+    }
+
+    radix_sort(arr, n) ;
+
+    printf("\n\nAfter sorting : ") ;
+    for(int i=0; i<n; i++){
+        printf("%d ",arr[i] );
+    }
+    return 0;
+}