Algorithms | Sorting | Question 23

Given an array where numbers are in range from 1 to n⁶, 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

Article Tags :

DSA Quiz

Algorithms-Sorting-Quiz

Recommended Articles

1. Algorithms | Sorting | Question 1

2. Algorithms | Sorting | Question 2

3. Algorithms | Sorting | Question 3

4. Algorithms | Sorting | Question 4

5. Algorithms | Sorting | Question 5

6. Algorithms | Sorting | Question 6

7. Algorithms | Sorting | Question 7

8. Algorithms | Sorting | Question 9

9. Algorithms | Sorting | Question 11

10. Algorithms | Sorting | Question 12

11. Algorithms | Sorting | Question 13

12. Algorithms | Sorting | Question 14

13. Algorithms | Sorting | Question 15

14. Algorithms | Sorting | Question 16

15. Algorithms | Sorting | Question 17

16. Algorithms | Sorting | Question 18

17. Algorithms | Sorting | Question 19

18. Algorithms | Sorting | Question 20

19. Algorithms | Sorting | Question 10

20. The Slowest Sorting Algorithms

21. Algorithms | Analysis of Algorithms (Recurrences) | Question 1

22. Algorithms | Analysis of Algorithms (Recurrences) | Question 2

23. Algorithms | Analysis of Algorithms | Question 2

24. Algorithms | Analysis of Algorithms | Question 3

25. Algorithms | Analysis of Algorithms | Question 4