341 views
0 votes
0 votes

 Minimun number of comparison required to compute the largest and second largest element in array is

A. n-[log₂n]-2
B. n+[log₂n-2]
C. log₂n
D. None of these
 

Answer Report Discuss

   

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Indu123 asked Aug 20, 2017
497 views
Consider the following type definition.typedef char x[10];x myArray[5];What will sizeof(myArray) be ? (Assume one character occupies 1 byte)A.15 bytesB.10 bytesC.50 byte...
2 votes
2 votes
0 answers
2
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4
Shrenik Pradhan asked Nov 16, 2023
204 views
How can I represent the ER model in tabular form? , in java point, the tabular form doesn't seem to be correct.Ref. https://www.javatpoint.com/dbms-reduction-of-er-diagra...