## Discussion Forum

Que. | 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? a) t (n) is O(1) b) n < t (n) < n log2n c) n log 2 n < t (n) < (n/2) d) t (n) = [/Tex]{n \choose 2} [/Tex] |

a. | a |

b. | b |

c. | c |

d. | d |

Answer:a |