From a9b97f2408da27ddded7c98689df2d0629936e14 Mon Sep 17 00:00:00 2001
From: Akash Maurya <48836353+AkashMaurya1430@users.noreply.github.com>
Date: Mon, 19 Oct 2020 20:55:12 +0530
Subject: [PATCH] Radix sort

---
 Sorting/radix sort.py | 57 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 57 insertions(+)
 create mode 100644 Sorting/radix sort.py

diff --git a/Sorting/radix sort.py b/Sorting/radix sort.py
new file mode 100644
index 0000000..9f695b2
--- /dev/null
+++ b/Sorting/radix sort.py	
@@ -0,0 +1,57 @@
+def countingSort(arr, exp1):
+ 
+    n = len(arr)
+ 
+    # The output array elements that will have sorted arr
+    output = [0] * (n)
+ 
+    # initialize count array as 0
+    count = [0] * (10)
+ 
+    # Store count of occurrences in count[]
+    for i in range(0, n):
+        index = (arr[i] / exp1)
+        count[int(index % 10)] += 1
+ 
+    # Change count[i] so that count[i] now contains actual
+    # position of this digit in output array
+    for i in range(1, 10):
+        count[i] += count[i - 1]
+ 
+    # Build the output array
+    i = n - 1
+    while i >= 0:
+        index = (arr[i] / exp1)
+        output[count[int(index % 10)] - 1] = arr[i]
+        count[int(index % 10)] -= 1
+        i -= 1
+ 
+    # Copying the output array to arr[],
+    # so that arr now contains sorted numbers
+    i = 0
+    for i in range(0, len(arr)):
+        arr[i] = output[i]
+ 
+# Method to do Radix Sort
+def radixSort(arr):
+ 
+    # Find the maximum number to know number of digits
+    max1 = max(arr)
+ 
+    # Do counting sort for every digit. Note that instead
+    # of passing digit number, exp is passed. exp is 10^i
+    # where i is current digit number
+    exp = 1
+    while max1 / exp > 0:
+        countingSort(arr, exp)
+        exp *= 10
+ 
+ 
+# Driver code
+arr = [170, 45, 75, 90, 802, 24, 2, 66]
+ 
+# Function Call
+radixSort(arr)
+ 
+for i in range(len(arr)):
+    print(arr[i])