## Java program to calculate Power (x,n) using Recursion | Pow(x,n) with Example

The below logic will calculate the integer power of a number that is X^N where N is a integer. X ^ N …

The below logic will calculate the integer power of a number that is X^N where N is a integer. X ^ N …

Sum of Digit of a given number is addition of all its individual digits of that number. Eg :sum of Digit of …

Greatest Common Divisor (GCD) or Greatest Common Factor (GCF), is the largest positive integer which divides both numbers. For example, consider 12, …

/* Sum of 1 to N natural numbers can be calculated using for / while loop very easily. In the below java program …

A permutation is an arrangement of set of objects in a particular order. The number of permutations of n objects is n*(n …

One of the powerful example for solving a problem using recursion is Towers of Hanoi puzzle. This tutorial covers about what is …

Let us start with an example. The following is the sample XML document to represent the Books details. Tree Representation of above …

/* Fibonacci Numbers are 1, 1, 2, 3, 5, 8, 13, 21, 34…. which can be calculated by the formula fn=fn-1+fn-2 where …