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) anjali007 asked Nov 17, 2018 anjali007 290 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply goxul commented Nov 17, 2018 reply Follow Share C? Edit: It's $O(logn)$. Check here: https://gateoverflow.in/452/gate2008-40 0 votes 0 votes anjali007 commented Nov 17, 2018 reply Follow Share I also thought that it is c bit the ans is O(logn).. I am not getting that why it is not c... 0 votes 0 votes adarsh_1997 commented Nov 17, 2018 i edited by adarsh_1997 Nov 17, 2018 reply Follow Share i thought it was 0(1). thanks for clarifying @goxul 0 votes 0 votes Please log in or register to add a comment.