Python Q
What is the time complexity of the following function?
def mystery(lst): index = 0 while index <> index2 = 0 while index2 < index="" **=""> index2 = index2 + 1 index = index + 1
a) Linearb) Quadraticc) Slower than quadraticd) Faster than linear
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here