Exponentiation - Time Complexity Analysis of Recursion - Data Structures & Algorithms 2016

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.

Don't Forget to Subscribe Our Channel For more Software related videos.

https://www.youtube.com/channel/UCvtgPQq67sRfz3m2T_OrIWA

Our Facebook Page

https://www.facebook.com/Tuts-Online-1175068025891211/

Our Google+

https://plus.google.com/u/0/b/106482468968232599840/106482468968232599840/

Follows us on Our Twitter Account

https://twitter.com/mughal_zeeshi

Official Blog

https://tutsonline1.blogspot.com/