info@avatto.com
+91-9920808017
0. The recurrence relation that arises in relation with the complexity of binary search is
T(n) = T(n/2) + K, where K is a constant
T(n) = 2T(n/2) + K, where K is a constant
T(n) = T(n/2) + log n
T(n) = T(n/2) + n
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.