GATE | GATE CS 2008 | Question 40

Last Updated :
Discuss
Comments

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

Θ(n)

Θ(logn)

Θ(n*logn)

Θ(1)

Share your thoughts in the comments