Merge pull request ZoranPandovski#1073 from ank47197/patch-1

Readme
Tflagg97 · Oct 2, 2018 · 6010bd5 · 6010bd5
2 parents 6752ed9 + 45303c7
commit 6010bd5
Showing 1 changed file with 8 additions and 0 deletions.
diff --git a/sort/counting_sort/Readme.md b/sort/counting_sort/Readme.md
@@ -0,0 +1,8 @@
+Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then doing some arithmetic to calculate the position of each object in the output sequence.
+
+Points to be noted:
+1. Counting sort is efficient if the range of input data is not significantly greater than the number of objects to be sorted. Consider the situation where the input sequence is between range 1 to 10K and the data is 10, 5, 10K, 5K.
+2. It is not a comparison based sorting. It running time complexity is O(n) with space proportional to the range of data.
+3. It is often used as a sub-routine to another sorting algorithm like radix sort.
+4. Counting sort uses a partial hashing to count the occurrence of the data object in O(1).
+5. Counting sort can be extended to work for negative inputs also.