The minimum number of comparisons required to determine if an ineger appears more than n/2 times in a sorted array of n integers is-

The minimum number of comparisons required to determine if an ineger appears more than n/2 times in a sorted array of n integers is-

A θ(n)

B θ(log n)

C θ(log*n)

D θ(1)

Solution

Correct Answer: Option B