Sorting Algorithms Questions
The best-case time complexity of counting sort is O(n + k), where n is the number of elements to be sorted and k is the range of the input values.