The GATE Grind

GATE 2008 CS – Question 40

Algorithms · Searching, Sorting and Hashing · 2 marks · Multiple choice

What minimum asymptotic number of comparisons determines whether an integer appears more than n/2 times in a sorted n-integer array?

  1. $\Theta(n)$
  2. $\Theta(\log n)$
  3. $\Theta(\log^*n)$
  4. $\Theta(1)$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) $\Theta(\log n)$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Searching, Sorting and Hashing questions

All Searching, Sorting and Hashing questions →