/* 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);
}
}
A Tech publication for all. Get Knowledge about Web Development, Programming, and trending news, tutorials, and tools for beginners to experts.
Friday, September 23, 2016
Subscribe to:
Post Comments (Atom)
-
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++);...
-
🌍 World Geo Data — Full Country, State, City & Currency Dataset This repository provides an overview of the World Geo Data digital pro...
-
Complete beginner-friendly guide to generate and install a free SSL certificate on Windows server If you’re running a website on Windows Se...
-
Learn how to configure Let’s Encrypt SSL on Windows 11 using Win-ACME and IIS. Securing your website with HTTPS is no longer optional—it’s a...
-
/* Transpose the matrix */ #include<stdio.h> int main() { int a[4][4],i,j,b; for(i=0;i<4;i++) { printf("\nEnter elements of %d...
-
N=39714 3 9 1 7 4 9 1 7 4 1 7 4 7 4 4 code: #include <stdio.h> int main() { long n = 39714, i=1; for(i=10;i<n;i*=10); f...
-
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)...
-
Great entrepreneurs think differently. Instead of seeing money as an income, they see it as an outcome: An outcome of pursuing their purpose...
-
/* Sort array of 10 strings. */ #include<string.h> #include<stdio.h> int main() { int i,j; char str[10][10],temp[10]; printf(...
-
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