Ask your own question, for FREE!
Mathematics 23 Online
OpenStudy (anonymous):

For the following recurrence, provide an asymptotic characterization. Need a push in the right direction. f (n) = f (n/3) + 1

OpenStudy (anonymous):

uhh....what is an asymptotic characterization?

OpenStudy (anonymous):

Oh man, my bad! Meant to post to Computer Science!

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!