A program to calculate power using recursion involves defining a function that recursively multiplies a base number by itself, decrementing the exponent until it reaches 0. The below-listed examples can be utilized to calculate powers using recursion in JavaScript.

Using Recursion

Basic recursion involves defining a function that calls itself with modified parameters until reaching a base case, where a specific condition is met. This approach simplifies solving complex problems by breaking them down into smaller, self-repeating tasks.

Example: The below code recursively calculates the power of the passed base number in JavaScript.

The recursively calculated value of 2^4 is: 16

Using Memoization with Recursion

Memoization optimizes recursive functions by caching computed results. Before computing, the function checks if the result for given inputs exists in the cache it returns the cached result. Otherwise, it computes the power, stores, and returns it. This reduces redundant computations, enhancing performance.

Example: The below code will use memoization technique with recursion to improve the performance.

The recursively calculated value of 3^4 is: 81