counting sort.py

Author: aish21

Practice Concepts/Sorting/counting-sort.py

@@ -0,0 +1,33 @@
+# Python implementation for Counting Sort Algorithm
+
+def countingsort(array):
+    size = len(array)
+    output = [0] * size
+
+    # Initialize the count array
+    count = [0] * 10
+
+    # Store the count of each element in the count array
+    for i in range(0, size):
+        count[array[i]] += 1
+
+    # Store the cummulative count
+    for i in range(1, 10):
+        count[i] += count[i - 1]
+
+    # Find the index of each element of the original array in count array place the elements in output array
+    i = size - 1
+    while i >= 0:
+        output[count[array[i]] - 1] = array[i]
+        count[array[i]] -= 1
+        i -= 1
+
+    # Copy the sorted elements into original array
+    for i in range(0, size):
+        array[i] = output[i]
+
+
+data = [4, 2, 2, 8, 3, 3, 1]
+countingsort(data)
+print("Sorted Array in Ascending Order: ")
+print(data)

README.md

@@ -515,7 +515,7 @@
 
 ![](https://github.com/aish21/Algorithms-and-Data-Structures/blob/main/Resources/Animations/quicksort.gif)
 
-### [Counting Sort](/Practice%20Concepts/Sorting/quick-sort.py)
+### [Counting Sort](/Practice%20Concepts/Sorting/counting-sort.py)
 * Sorts the elements of an array by counting the number of occurances of each unique element in the array.
 * The count is stored in an auxiliary array and the sorting is done by mapping the count as an index of the auxiliary array.
 * Method: