GATE | CS | 2021 | Set 1 | Algorithms | Divide-and-Conquer | Question 12

Last Updated :
Discuss
Comments

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?

t>2n−2

t>3⌈n/2⌉ and t≤2n−2

t>n and t≤3⌈n/2⌉

t>⌈log2(n)⌉ and t≤n

This question is part of this quiz :

Top MCQs on Divide and Conquer Algorithm with Answers,GATE CS 2021 | Set 1,Top 50 Algorithms MCQs with Answers,Algorithms GATE CS PYQ Quiz,Greedy/Divide & Conquer Approach GATE CS PYQ Quiz
Tags:
DSA Quiz
GATE
Algorithms
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy