290 views
0 votes
0 votes
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) O(logn)

b)O(n)

c)O(1)

d)O(log*n)

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
himgta asked Sep 5, 2018
289 views
https://gateoverflow.in/8283/gate2015-1-35how x+3 and *(x+3) printing the same output
0 votes
0 votes
2 answers
3
himgta asked Sep 4, 2018
1,589 views
https://gateoverflow.in/204103/gate2018-29?show=204103#q204103in this question wht is passed in function 1.....what actually 1st function is doing?
0 votes
0 votes
0 answers
4
himgta asked Sep 4, 2018
386 views
https://gateoverflow.in/204076/gate2018-2Why the answer is A,Why not D?