41. The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is 4 digit decimal number)
You must be logged in to post a 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?
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)?
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?
UGC NET PAPER 1
UGC NET Management
UGC NET COMPUTER SCIENCE
UGC NET COMMERCE
GATE COMPUTER SCIENCE
CFA Level 1
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