Jump to content

Recommended Posts

Posted
give asymptotic upper bounds for t(n), bounds should be as tight as possible, assume n is power of 2.

1. t(n)=t(2)=1

t(n)=t(n-2)+1 if n>2

2. t(1)=1

t(n)=t(n/2)+1 if n>1
  • 2 weeks later...
Posted (edited)

pankajkumar,

 

Do you know English?

 

It is odd you do not respond to questions, or acknowledge anyone who replies to your posts.

And, you continue to post nearly the same few things again and again.

 

Again, this appears to be a homework problem, and if it is should be posted in the Homework Forum.

So far, no one has done your homework, but if you continue to post, someone may think they are helping you by doing one of your problems.

 

If this is not homework, you will get a better response if you communicate with people on this and other threads, instead of always posting a new thread.

Edited by EdEarl

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
×
×
  • 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.