DSA - Level 1 - Calculate Power using Recursion (Logarithmic) | Recursion in JAVA

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that. NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss an alternative approach to find the power of a number which is efficient than the earlier discussed linear approach. With this solution, the new time complexity is log(n) which is quite efficient than the previous approach. To watch the previous approach, click here: https://youtu.be/EohIyWnQYBY. The previous version expects the call stack to be of n height. This function expects call function to be only log(n) high. To attempt and submit this question, click here: https://www.pepcoding.com/resources/online-java-foundation/introduction-to-recursion/power-logarithmic-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation #recursion #algorithm Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education