info@avatto.com
+91-9920808017
0. The running time of an algorithm T(n) where (n) is the input size is given by T(n) = 8T (n/2) + qn, if n > 1 p, if n = 1 where p, q are constants. The order of the algorithm is
n2
nn
n3
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.