Maths package ,PowRecursion.java ,Its performance can be improved using divide and Conquer approach

[RishabhSharma333]

Performance improvement using divide and Conquer approach(gives O(log(n)) complexity as compared to O(n) complexity)
in PowRecursion.java of Math package.
I have included this approach in pull Request

[stale]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[stale]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!