diff --git a/cpp/radix_sort.cpp b/cpp/radix_sort.cpp
new file mode 100644
index 0000000..a3d084f
--- /dev/null
+++ b/cpp/radix_sort.cpp
@@ -0,0 +1,50 @@
+// C++ implementation of Radix Sort
+
+#include <iostream>
+using namespace std;
+int getMax(int arr[], int n)
+{
+	int mx = arr[0];
+	for (int i = 1; i < n; i++)
+		if (arr[i] > mx)
+			mx = arr[i];
+	return mx;
+}
+void countSort(int arr[], int n, int exp)
+{
+	int output[n]; 
+	int i, count[10] = { 0 };
+	for (i = 0; i < n; i++)
+		count[(arr[i] / exp) % 10]++;
+	for (i = 1; i < 10; i++)
+		count[i] += count[i - 1];
+	for (i = n - 1; i >= 0; i--) {
+		output[count[(arr[i] / exp) % 10] - 1] = arr[i];
+		count[(arr[i] / exp) % 10]--;
+	}
+	for (i = 0; i < n; i++)
+		arr[i] = output[i];
+}
+void radixsort(int arr[], int n)
+{
+	int m = getMax(arr, n);
+	for (int exp = 1; m / exp > 0; exp *= 10)
+		countSort(arr, n, exp);
+}
+void print(int arr[], int n)
+{
+	for (int i = 0; i < n; i++)
+		cout << arr[i] << " ";
+}
+
+
+int main()
+{
+	int arr[] = { 175, 40, 70, 95, 809, 25, 2, 66 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+	
+	// Function Call
+	radixsort(arr, n);
+	print(arr, n);
+	return 0;
+}