info@avatto.com
+91-9920808017
41. The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is 4 digit decimal number)
280
40
47
38
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
42. Which of the following algorithms exhibits the unnatural behavior that, the minimum number of comparisons are needed if the list to be sorted is in the reverse sorted order and a maximum number of comparisons are needed if they are already in sorted order?
heap sort
Radix sort
Binary insertion sort
There can't be any such sorting method
43. Which of the following sorting algorithm has the worst time complexity of nlog(n)?
Heap sort
Quick sort
Insertion nsort
Selection sort
44. Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?
Insertion sort
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
