info@avatto.com
+91-9920808017
0. Minimun number of comparison required to compute the largest and second largest element in array is
n-[log2n]-2
n+[log2n]-2
log2n
None of these
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.