Multiple choice

The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is

  1. $\Theta(n)$
  2. $\Theta(\log n)$
  3. $\Theta(\log^*n)$
  4. $\Theta(1)$
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Keep practicing — related questions