Modular Exponentiation using recursion (Better approach)

Question

Modular Exponentiation using recursion (Better approach)

drishika2002 opened this issue 3 years ago · 1 comments

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.

Answer 1 · 2021-05-29T18:35:45.000Z

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.