UGC-NET | UGC NET CS 2015 Jun – II | Question 48
Which of the following algorithms sort n integers, having the range 0 to (n2 – 1), in ascending order in O(n) time ?
(A) Selection sort
(B) Bubble sort
(C) Radix sort
(D) Insertion sort
- Selection sort takes O(n2) time.
- Bubble sort takes O(n2) time.
- Radix sort takes O(n) time.
- Insertion sort takes O(n2) time.
So, option (C) is correct.
Quiz of this Question