Merge pull request #339 from thesmartdeveloperr/main

add the radix sort algorithm in cpp

Author: hhhrrrttt222111

ALGORITHMS/Sorting/RadixSort/RadixSort.cpp

@@ -0,0 +1,48 @@
+#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];
+}
+//the main function which does radix sort
+void radixsort(int arr[], int n)
+{
+	int m = getMax(arr, n);
+
+	for (int exp = 1; m / exp > 0; exp *= 10)
+		countSort(arr, n, exp);
+}
+//driver function
+int main()
+{
+	int arr[] = { 170, 45, 75, 90, 802, 24, 2, 66 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+	radixsort(arr, n);
+	for(int i = 0; i < n; i++)
+	cout << arr[i] << " ";
+	return 0;
+}

ALGORITHMS/Sorting/RadixSort/readme.md

@@ -0,0 +1,3 @@
+# Radix Sort
+
+The idea of Radix Sort is to do digit by digit sort starting from least significant digit to most significant digit. Radix sort uses counting sort as a subroutine to sort.