*Tower Of Hanoi using Recursion*

Write a C Program to implement Tower Of Hanoi using Recursion. Here’s simple Program to implement Tower Of Hanoi using Recursion in C Programming Language.

**Recursion : :**

**Recursion : :**

- Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a
of the function.**recursive call**

- The C programming language supports recursion, i.e., a function to call itself. But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.

- Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.

Here is the source code of the C Program to implement Tower Of Hanoi using Recursion. The C Program is successfully compiled and run on a Windows system. The program output is also shown below.

**SOURCE CODE : :**

**SOURCE CODE : :**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 | /* C Program to implement Tower Of Hanoi using Recursion */ #include <stdio.h> #include <conio.h> void hanoi(char,char,char,int); int main() { int num; printf("Enter No. of Disks u want :: "); scanf("%d",&num); printf("\nTower of Hanoi for %d number of disks are :: \n", num); hanoi('A','B','C',num); return 0; } void hanoi(char from,char to,char other,int n) { if(n<=0) printf("\nPlease Provide at least one disk !!!!\n "); if(n==1) printf("\nMove Disk from %c to %c\n",from,other); if(n>1) { hanoi(from,other,to,n-1); hanoi(from,to,other,1); hanoi(to,from,other,n-1); } } |

**Output : :**

**Output : :**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 | /* C Program to implement Tower Of Hanoi using Recursion */ Enter No. of Disks u want :: 4 Tower of Hanoi for 4 number of disks are :: Move Disk from A to B Move Disk from A to C Move Disk from B to C Move Disk from A to B Move Disk from C to A Move Disk from C to B Move Disk from A to B Move Disk from A to C Move Disk from B to C Move Disk from B to A Move Disk from C to A Move Disk from B to C Move Disk from A to B Move Disk from A to C Move Disk from B to C Process returned 0 |

Above is the source code for C Program to implement Tower Of Hanoi using Recursion which is successfully compiled and run on Windows System.The Output of the program is shown above .

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may * Contact Us* through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.

**Thanks for reading the post….**