Doubt

Question

Let $S$ be a sorted array of n integers. Let $T(n)$ denote the time taken for the most efficient algorithm to determined all elements with sum less than $10000$ in $S$. Which of the following statement is true?

1. $T(n)$ is $O(1)$
2. $n \leq T(n)\leq nlog_2n$
3. $nlog_2n\leq T(n)<n^2$
4. $T(n)=(n^2)$
5. $\text{None of these}$.

Answer 1

it should be o(nlogn)

Comments

i have edited the question,can you plz see once again