Exponentiation - Time Complexity analysis of recursion

See complete series on recursion here
http://www.youtube.com/playlist?list=PL2_aWCzGMAwLz3g66WrxFGSXvSsvyfzCO
We will analyze the time complexity of recursive program to calculate x^n (X to power n). Refer to previous lessons on how to calculate x^n recursively. The recurrence relation to calculate modular exponentiation (x^n mod M) is similar and hence time complexity analysis will be the same.

Видео Exponentiation - Time Complexity analysis of recursion канала mycodeschool