Register to reply 
Can I use Master Theorem if the partitions are not fractions? 
Share this thread: 
#1
Mar212, 04:02 PM

P: 467

1. The problem statement, all variables and given/known data
If I had a recurrence expression that recurs on partitions of size n  1 each time, (as opposed some fraction of the original size ie. n/2), how can I apply the Master Theorem? I don't know what the "b" value is? 2. Relevant equations 3. The attempt at a solution ie. If I had 2 C(n1) + f(n), what is b? 


#2
Mar412, 01:40 PM

P: 127

You can not use the Master Theorem in this case, just use the recursion tree method. In this case it is easy to see that it will be exponential, since each level has twice the number of nodes of the previous level.



#3
Mar512, 08:42 AM

P: 467

I see that each recursion will have twice the calls to the function as the last, but they are also on one less element than the last, does that matter? Actually nevermind, so if I find a closed form expression it will be 2^n, right? 


#4
Mar512, 08:52 AM

P: 127

Can I use Master Theorem if the partitions are not fractions?



#5
Mar512, 09:42 AM

P: 467

Oh I see. It says that f(n) is constant. But it doesn't say what C(0) is.



Register to reply 
Related Discussions  
Statistics with Baye's theorem and partitions  Precalculus Mathematics Homework  3  
Asymptotic lower/upper bounds for T(n) [Master Theorem?]  Calculus & Beyond Homework  0  
Master Theorem  Calculus & Beyond Homework  0 