Ganesh NimbolkarMember The minimum number of comparisons required to determine if an integer appears more than n/2 times in sorted array of n integers is: (a) n (b) log n (c) log * n (d) 1 (constant)??????
The minimum number of comparisons required to determine if an integer appears more than n/2 times in sorted array of n integers is:
(a) n
(b) log n
(c) log * n
(d) 1 (constant)??????