algorithm - Recursion Trees and Asymptotic Complexity: T(n) = T(n/3) + T(n/2) + n -
I am trying to use recursive trees to find the acetic acid complexity of this function:
< Blockquote>T (n) = t (n / 3) + t (n / 2) + n if n> 5 ; Otherwise, T (n) = 1
I made a recursive tree and determined that each level's _ (5/6) ^ of * n_ complexity Level Here, I'm not sure how to move forward. I know that I have to understand the complexity of depth, but it is not really sure how to do it.
As an indicator, use the formula for the sum of a geometric series:
1 + (5/6) + (5/6) 2 + (5/6) 3 + ... = 1 / ( 1 - 5/6) = 6
Hope it helps!
Comments
Post a Comment