Minimun number of comparison required to compute the largest and secon – McqOptions

MCQOPTIONS

1.	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» C. log n

Discussion

No Comment Found

Related MCQs

Consider the declaration char street[10] = "abcdefghi"; Choose the correct remark(s)
A file is preferable to an array of structures because
Pick the correct answers if x is an one dimensional array, then
Choose the correct statements
While sorting a set of names, representing the names as an array of pointers is preferable to representing the names as a two dimensional array of characters because
If arr is a two dimensional array of 10 rows and 12 columns, then arr (5) logically points to the
A set of names can be represented as a
Which of the following concepts make extensive use of arrays?
When does the ArrayIndexOutOfBoundsException occur?
What is the output of the following piece of code? public class array { public static void main(String args[]) { int []arr = {1,2,3,4,5}; System.out.println(arr[5]); } }