Code refactored and removed unecessary loops

Author: Gaurav-2803

python/Count_Sort.py

@@ -1,26 +1,20 @@
 def countingSort(array):
     size = len(array)
-    output = [0] * size
 
-    count = [0] * 10
+    output, count = [0] * size, [0] * 10
 
-    for i in range(0, size):
+    for i in range(size):
         count[array[i]] += 1
 
     for i in range(1, 10):
         count[i] += count[i - 1]
 
-    i = size - 1
-    while i >= 0:
+    for i in range(size - 1, -1, -1):
         output[count[array[i]] - 1] = array[i]
         count[array[i]] -= 1
-        i -= 1
 
-    for i in range(0, size):
-        array[i] = output[i]
+    return output
 
 
 data = [4, 2, 2, 8, 3, 3, 1]
-countingSort(data)
-print("Sorted Array in Ascending Order: ")
-print(data)
+print(f"Sorted Array in Ascending Order: {countingSort(data)}")