## Towers of Hanoi using Recursion in Java

Towers of Hanoi is a mathematical puzzle, consists of three towers (rods or pegs) and number of disks of different

## Reversing an array using Recursion in Java

Reversing an array using Recursion is an example of Tail Recursion . We maintain two in-variants “i” and “j”. “i” holds

## Linear Sum using Recursion in Java

Linear Sum, sum of the “n” array elements can be computed easily by looping through the elements, this can be

## Fibonacci series using Recursion in Java

Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers by definition, the first two numbers in the Fibonacci sequence are 1 and 1,

## Power of a given number using Recursion in Java

Power of a given number, x is a mathematical operation, written as  x^n. involving two numbers, the base x and the exponent  (or index or power)

## Factorial of a number using Recursion

Factorial of a number is defined as the product of natural numbers starting from 1 to the number that we

## Euclid’s Algorithm for finding GCD of two numbers

Finding Greatest Common Divisor (GCD of two numbers) is a simple mathematical problem, the algorithm (Euclid’s Algorithm) for which was

## Reverse of a String using recursion in Java

Reverse of a String with out using Library functions is a general interview question.For any such questions, check whether the

## Binary Search Algorithm implementation with Recursion in Java

Let me explain the Binary Search algorithm through a well known example of Dictionary. Let us consider, searching a word

## Linear Search Algorithm variations in Java

Linear Search is a brute force approach or sequential approach for finding value in a list of values. Even though,