/* Towers of Hanoi by recursion */
#include<stdio.h>
void toh(int,char,char,char);
int main()
{
int n=3;
toh(n,'A','B','C');
return 0;
}
void toh(int n,char a,char b,char c)
{
if(n==1)
printf("\nMoved from %c to %c",a,c);
else
{
toh(n-1,a,c,b);
toh(1,a,' ',c);
toh(n-1,b,a,c);
}
}
Friday, 23 September 2016
Subscribe to:
Post Comments (Atom)
Featured post
The Thrill of Programming: Exploring the Satisfaction Behind the Code
Different individuals find satisfaction in programming for various reasons. Here are some common factors that tend to bring satisfaction to ...
-
1 23 456 78910 #include<stdio.h> int main() { int i,j,k; k=1; for(i=1;i<5;i++) { for(j=1;j<=i;j++) { printf("%d",k++);...
-
1 10 101 1010 10101 #include<stdio.h> int main() { int i,j,k; for(i=1;i<=5;i++) { for(j=1;j<=i;j++) { printf("%d",j%2)...
-
13579 3579 579 79 9 #include <stdio.h> int main() { int i,j; for(i=1;i<=9;i+=2) { for(j=i;j<=9;j+=2) { print...
-
12345 4321 123 21 1 int main() { int i,j,k; for(i=5;i>=1;i--) { if(i%2==1) k=1; else k=i; for(j=1;j<=i;j++) { printf("%d",k)...
-
1234567 12345 123 1 int main() { int i,j; for(i=7;i>=1;i-=2) { for(j=1;j<=i;j++) { printf("%d",j); } printf("\n");...
No comments:
Post a Comment