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 of the following statement is true?
Option A. Because array is always sorted just check the 1st two elements.
Let's say |c| = 5 and |p| = ...