Asymptotic runtime question

Posted by 2hype on Stack Overflow See other posts from Stack Overflow or by 2hype
Published on 2010-05-12T15:20:34Z Indexed on 2010/05/12 15:24 UTC
Read the original article Hit count: 345

Filed under:

big-theta

If f(n) is T(g(n)), then the function 2^(f(n)) is always T(2^(g(n))). Is this statement true or false, and why?

Related posts about big-theta

Proving that a function f(n) belongs to a Big-Theta(g(n))

as seen on Stack Overflow - Search for 'Stack Overflow'
Its a exercise that ask to indicate the class Big-Theta(g(n)) the functions belongs to and to prove the assertion. In this case f(n) = (n^2+1)^10 By definition f(n) E Big-Theta(g(n)) <= c1*g(n) < f(n) < c2*g(n), where c1 and c2 are two constants. I know that for this specific f(n) the… >>> More
Indicates the Big-Theta g(n) and prove it [closed]

as seen on Stack Overflow - Search for 'Stack Overflow'
Indicates the Big-Theta g(n) for the function below and prove it (n^2 + 1)^10 I don not know how to prove it. >>> More
Programmaticaly finding the Landau notation (Big O or Theta notation) of an algorithm?

as seen on Programmers - Search for 'Programmers'
I'm used to search for the Landau (Big O, Theta...) notation of my algorithms by hand to make sure they are as optimized as they can be, but when the functions are getting really big and complex, it's taking way too much time to do it by hand. it's also prone to human errors. I spent some time on… >>> More
Recurrence relation solution

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm revising past midterms for a final exam this week and am trying to make sense of a solution my professor posted for one of past exams. (You can see the original pdf here, question #6). I'm given the original recurrence relation T(m)=3T(n/2) + n and am told T(1) = 1. I'm pretty sure the solution… >>> More
Big 0 theta notation

as seen on Stack Overflow - Search for 'Stack Overflow'
Can some pls help with the solution Use big-O notation to classify the traditional grade school algorithms for addition and multiplication. That is, if asked to add two numbers each having N digits, how many individual additions must be performed? If asked to multiply two N-digit numbers, how many… >>> More

Developer IT

Asymptotic runtime question - Developer IT

Asymptotic runtime question

big-theta

Related posts about big-theta

Proving that a function f(n) belongs to a Big-Theta(g(n))

Indicates the Big-Theta g(n) and prove it [closed]

Programmaticaly finding the Landau notation (Big O or Theta notation) of an algorithm?

Recurrence relation solution

Big 0 theta notation

Categories cloud