Please solve using iterative method:
Solve the following recurrences and compute the asymptotic upper bounds. Assume that T(n) is a constant for sufficiently small n. Make your bounds as tight as possible.
a. T(n) = T(n − 2) + √n
b.T(n) = 2T(n − 1) + c
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here