Modular Exponentiation using recursion (Better approach)

Algo-Phantoms / Algo-Tree

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.

MIT License

363 stars 619 forks source link

Modular Exponentiation using recursion (Better approach) #2046

Closed drishika2002 closed 3 years ago

drishika2002 commented 3 years ago

Problem Statement

Calculate the value of ( (x^n) % K ) using recursion with time complexity O(log n)

Language: C++

Please assign this issue to me.

github-actions[bot] commented 3 years ago

Hi 😄, @drishika2002 Thanks for creating issue at AlgoTree, do read and follow the Code of Conduct and the Contribution Guidelines while contributing. Refer to PR's which has been merged earlier in AlgoTree Click Here Like, How many File they have changed?, Which type of files need to be change? and many more.