diff --git a/Radixsort.cpp b/Radixsort.cpp
new file mode 100644
index 0000000..0f87bf0
--- /dev/null
+++ b/Radixsort.cpp
@@ -0,0 +1,72 @@
+#include <iostream>
+ 
+using namespace std;
+ 
+// Get maximum value from array.
+int getMax(int arr[], int n)
+{
+	int max = arr[0];
+	for (int i = 1; i < n; i++)
+		if (arr[i] > max)
+			max = arr[i];
+	return max;
+}
+ 
+// Count sort of arr[].
+void countSort(int arr[], int n, int exp)
+{
+	// Count[i] array will be counting the number of array values having that 'i' digit at their (exp)th place.  
+	int output[n], i, count[10] = {0};
+ 
+	// Count the number of times each digit occurred at (exp)th place in every input.
+	for (i = 0; i < n; i++)
+		count[(arr[i] / exp) % 10]++;
+ 
+	// Calculating their cumulative count.
+	for (i = 1; i < 10; i++)
+		count[i] += count[i-1];
+ 
+	// Inserting values according to the digit '(arr[i] / exp) % 10' fetched into count[(arr[i] / exp) % 10].
+	for (i = n - 1; i >= 0; i--)
+	{
+		output[count[(arr[i] / exp) % 10] - 1] = arr[i];
+		count[(arr[i] / exp) % 10]--;
+	}
+ 
+	// Assigning the result to the arr pointer of main().
+	for (i = 0; i < n; i++)
+		arr[i] = output[i];
+}
+ 
+// Sort arr[] of size n using Radix Sort.
+void radixsort(int arr[], int n)
+{
+	int exp, m;
+	m = getMax(arr, n);
+ 
+	// Calling countSort() for digit at (exp)th place in every input.
+	for (exp = 1; m/exp > 0; exp *= 10)
+		countSort(arr, n, exp);
+}
+ 
+int main()
+{
+	int n, i;
+	cout<<"\nEnter the number of data element to be sorted: ";
+	cin>>n;
+ 
+	int arr[n];
+	for(i = 0; i < n; i++)
+	{
+		cout<<"Enter element "<<i+1<<": ";
+		cin>>arr[i];
+	}
+ 
+	radixsort(arr, n);
+ 
+	// Printing the sorted data.
+	cout<<"\nSorted Data ";
+	for (i = 0; i < n; i++)
+		cout<<"->"<<arr[i];
+	return 0;
+}
diff --git a/sorting/radixSort.cpp b/sorting/radixSort.cpp
index da139b7..332da45 100644
--- a/sorting/radixSort.cpp
+++ b/sorting/radixSort.cpp
@@ -1,7 +1,8 @@
+//c++ program for radix sort
 #include<iostream>
 
 using namespace std;
-
+//this function is used to divide the value and we get a new digit
 int getMaxDivision(int value)
 {
     int count = 0;
@@ -12,7 +13,7 @@ int getMaxDivision(int value)
     }
     return count;
 }
-
+//evaluates the remainder
 int divideTimes(int value,int times)
 {
     int temp = value;
@@ -83,7 +84,7 @@ int main()
             }
         }
     }
-
+    //display
     cout<<"Sorted Array is: "<<endl;
     for(index = 0; index <arraySize; index++)
     {