counting sort added

Author: arorarahul

README.md

@@ -10,6 +10,7 @@ TODO: question14.c
 - merge sort using dynamic programming and hashmaps
 - duplicate elimination from an array
 - union, intersection and difference of two arrays
+- bucket sort
 
 
 ### General Questions

arrays/question6.c

@@ -6,8 +6,8 @@ In each iteration one greatest element moves to its correct position.
 It can be remembered as in each iteration the bubble(largest element) comes to the top (last in array)
 
 Time Complexity:
-Best case: O(n)
-Worst case: O(n^2)
+Best case: O(n) -- already sorted just checking by looping once or for value very less than n
+Worst case: O(n^2) -- nested loop
 
 Space Complexity:
 O(1)