info@avatto.com
+91-9920808017
0. When s be a sorted array of n integers, and t(n) denote the time taken for the most efficient algorithm to determine if there are two elements with sum less than 1000 in s, then which of the following statements is true?
t(n) is O(1)
n ≤ t(n) ≤ n log1n
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.