I need you to answer this for me:
Give an upper and lower bound to this recursive function. $$T(h) = T\left(n^{2/3}\right) +20$$
I tried the iterative method and got stuck. is it possible to just guess the answer and prove it by induction?
I need you to answer this for me:
Give an upper and lower bound to this recursive function. $$T(h) = T\left(n^{2/3}\right) +20$$
I tried the iterative method and got stuck. is it possible to just guess the answer and prove it by induction?
Copyright © 2021 JogjaFile Inc.