Question
Which data structure or concept is best described as a non-comparison sort that counts occurrences of bounded integer keys?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Counting Sort
Explanation:
Counting Sort is a non-comparison sort that counts occurrences of bounded integer keys.
This description distinguishes it from the other choices.
Leave a Reply