Computer Sciences > GATE 2021 SET-1 > Divide and Conquer
Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of n elements. Which one of the following choices is correct?
A
t>2n−2
B
t>3⌈n/2⌉ and t≤2n−2
C
t>n and t≤3⌈n/2⌉
D
t>⌈log2(n)⌉ and t≤n

Correct : b

Similar Questions

A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From...
#1 MCQ
Which number does not belong in the series below? 2, 5, 10, 17, 26, 37, 50, 64
#4 MCQ
Choose the word that is opposite in meaning to the word “coherent”.
#5 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......