Given a list of n integers, each lying in the range [1..k]. Assertion: The worst-case time-complexity of Counting Sort for this list is O(n + k).

icon
Related questions
Question

true or false:

Given a list of n integers, each lying in the range [1..k].
Assertion: The worst-case time-complexity of Counting Sort for this list is O(n + k).
Transcribed Image Text:Given a list of n integers, each lying in the range [1..k]. Assertion: The worst-case time-complexity of Counting Sort for this list is O(n + k).
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer