Sorting Algorithms · Counting Sort and Radix Sort in Python: When O(n) Sorting Is Legit
Question 1 of 5
Why can counting sort run in O(n + k) when the n log n lower bound exists for sorting?
Tip: press 1-4 to answer, Enter to continue. Finish the quiz to bank your XP.