Algorithms | Analysis of Algorithms | Question 17

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 statements is true? (GATE CS 2000)
a) t (n) is 0 (1)
b) n < t (n) < n[Tex] {log_2 n} [/Tex]
c) n log 2 n < t (n) < [Tex]{n \\choose 2} [/Tex]
d) t (n) = [Tex]{n \\choose 2} [/Tex]

(A)

(B)

(C)

(D)