From 98a7f0160108b233562eb37ec425412b72567711 Mon Sep 17 00:00:00 2001
From: SHIVAM MISHRA <56154029+SHIVA-JI@users.noreply.github.com>
Date: Fri, 28 Oct 2022 15:21:33 +0530
Subject: [PATCH] Create Redix_Sort in C++

---
 Redix_Sort in C++ | 67 +++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 67 insertions(+)
 create mode 100644 Redix_Sort in C++

diff --git a/Redix_Sort in C++ b/Redix_Sort in C++
new file mode 100644
index 0000000..7e196c2
--- /dev/null
+++ b/Redix_Sort in C++	
@@ -0,0 +1,67 @@
+#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]; // output array
+    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] << " ";
+}
+ 
+// Driver Code
+int main()
+{
+    int arr[] = { 170, 45, 75, 90, 802, 24, 2, 66 };
+    int n = sizeof(arr) / sizeof(arr[0]);
+     
+      // Function Call
+      radixsort(arr, n);
+    print(arr, n);
+    return 0;
+}