info@avatto.com
+91-9920808017
0. 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
You must be logged in to post a comment.
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
You must be logged in to post a comment.