Algorithms | Misc | Question 5

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is
(A) (n)
(B) (logn)
(C) (log*n)
(D) (n)

(A) A
(B) B
(C) C
(D) D


Answer: (B)

Explanation: Please see the post Check for majority element in a sorted array for details.

Quiz of this Question