sorted-array

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

Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s. which o...