Question

Use C/C++/Java/VBasic only for writing the code.

II Tower of Hanoi

Write a recursive function that implements the Tower of Hanoi problem. Draw a control flow graph for this function.

Answer 1

Code:

#include<stdio.h>
static int count=0;
void toh(int p, char from, char to, char a)
{
   if(p==0) return;
if (p == 1)
{
printf(" 1: %c to %c",from,to);
count++;
return;
}
toh(p-1,from,a,to);
printf(" %d: %c to %c",p,from,to);
count++;
   toh(p-1,a,to,from);
}
int main()
{
int n;
printf("How many disks:");
scanf("%d",&n);
toh(n,'A','B','C');
printf(" Total moves:%d",count);
return 0;
}

Output:

Control flow graph for input n=3: