Calculate pow(x, n) using Recursion
In PHP, you can calculate the power of a number using recursion by defining a function that calls itself with a reduced exponent until the base case is reached. The base case is when the exponent is 0, in which case the function returns 1. Otherwise, the function multiplies the base number by the result of the function called with the reduced exponent.
Explanation:
- The
power( )
function checks ifn
is0
, in which case it returns1
(since any number raised to the power0
is1
). - If
n
is not0
, it multipliesx
by the result ofpower(x, n - 1)
, effectively reducing the problem to a smaller one.
Example: Implementation to calculate pow(x,n).
PHP
<?php function power( $x , $n ) { if ( $n == 0) { return 1; } return $x * power( $x , $n - 1); } // Driver code $x = 2; $n = 3; $result = power( $x , $n ); echo "$x to the power $n is $result" ; ?> |
2 to the power 3 is 8
PHP Program to Calculate pow(x, n)
Calculating the power of a number is a common mathematical operation. In PHP, this can be done using the pow( )
function, which takes two arguments, the base x
and the exponent n
, and returns x
raised to the power of n
. In this article, we will explore different approaches to calculate pow(x, n)
in PHP, including using the built-in function and implementing custom functions for educational purposes.
Table of Content
- Using the pow( ) Function
- Using a Loop
- Using Recursion