Category Archives: Recursion

Tower of Hanoi using Recursion – C Program

Tower of Hanoi C Program

write a c program for solve tower of hanoi using recursion.

The basic idea behind the tower of hanoi is if you can solve n-1 cases then you can easily solve the n th cases.

Tower of hanoi is one of the application of stack data structure.

below is c program code to understand tower of hanoi example.

The out put of tower of hanoi c program is :


Fibonacci sequence series program using recursion in C Language

The Fibonacci Sequence is the series of numbers as below :
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418,………………

Here is the C Program to understand Fibonacci Series using recursion.

Recursion : If the function call it self then the function known as recursive function and the all process known as recursion.

Fibonacci Series Program:

The output of Fibonacci Series is :