Skip to content
Related Articles

Related Articles

Algorithms | Sorting | Question 23

View Discussion
Improve Article
Save Article
  • Difficulty Level : Easy
  • Last Updated : 28 Jun, 2021
View Discussion
Improve Article
Save Article

Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time?
(A) Not possible to sort in linear time
(B) Radix Sort
(C) Counting Sort
(D) Quick Sort


Answer: (B)

Explanation: See Radix Sort for explanation.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!