UGC-NET | UGC NET CS 2015 Jun - II | Question 48

Last Updated :
Discuss
Comments

Which of the following algorithms sort n integers, having the range 0 to (n2 - 1), in ascending order in O(n) time ?

Selection sort
Bubble sort
Radix sort
Insertion sort
Share your thoughts in the comments