Q1.15

MCQ1 mark, −0.25

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?

(A)

$T (n)$ is $O(1)$

(B)

$n \leq T(n) \leq n \log_2 n$

(C)

$n \log_2 n ≤ T(n) < \frac{n}{2}$

(D)

$T(n) = \left (\frac{n}{2} \right)$

Loading…