1.11M Members

Towers of Hanoi(Recursion)

 
0
 
#include<stdio.h>
#include<conio.h>
#include<math.h>
void hanoi(int x, char from,char to,char aux)
{

if(x==1)
{
printf("Move Disk From %c to %c\n",from,to);
}
else
{
hanoi(x-1,from,aux,to);
printf("Move Disk From %c to %c\n",from,to);
hanoi(x-1,aux,to,from);
}

}
void main()
{
 int disk;
 int moves;
 clrscr();
 printf("Enter the number of disks you want to play with:");
 scanf("%d",&disk);
 moves=pow(2,disk)-1;
 printf("\nThe No of moves required is=%d \n",moves);
 hanoi(disk,'A','C','B');
 getch();
 }
 
0
 

Please stop posting poorly formated non-standard code for no reason at all. If you insist on spamming the forum with pointless threads, I'll delete them without hesitation.

 
0
 

If you are so inclined to contribute fully-working code snippets, they would be most appreciated in our code snippet library @ www.daniweb.com/code/ - not the forums.

Thanks!

 
-1
 

thanks for the program ...its g8 with few errors which can b corrected easily

 
0
 

If you full code in correct format you can add in the code snippets rather posting on the forum
Thanks!!

 
0
 

i am still in confusion in TOH recursive function how line number 13 and 15 executes both of them executes concurrently or what??

You
This article has been dead for over six months: Start a new discussion instead
Post:
Start New Discussion
Tags Related to this Article