Modular Exponentiation using Recursion - Data Structures & Algorithms 2016

In this lesson, we will see an efficient recursive algorithm to calculate (x^n)%M - (x to power n modulo n)

Prerequisite: Basic knowledge of recursion in programming.

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/