Jump to content
Sign in to follow this  
gate13

recursive algorithm order

Recommended Posts

Running time T(n), where n is input size of recursive algorithm is given as follows T(n) = A + T(n-1), if n > 2, T(n) = d if n<=1.

wi

Edited by gate13

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  

×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.