|Dec3-05, 02:59 PM||#1|
T(0) = 1
T(n) = T(n-1) + root(T(n-1))
how many recursion does T(n) need to grow to the number k?
can I get this? root(k) < m < c root(k)
c is constant and m is the times we need for T(n) goes to k.
Any help appreciated!!
|Similar discussions for: recursive question|
|Recursive Relations.||Set Theory, Logic, Probability, Statistics||0|
|recursive definition||Calculus & Beyond Homework||3|
|recursive algorithm||Calculus & Beyond Homework||6|
|recursive question||General Math||1|
|non-recursive formula||General Math||3|