Tower of Hanoi in C

tower of hanoi c 1 year, 8 months ago
#include <stdio.h> void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) { if (n == 1) { printf("\n Move disk 1 from rod %c to rod %c", from_rod, to_rod); return; } towerOfHanoi(n-1, from_rod, aux_rod, to_rod); printf("\n Move disk %d from rod %c to rod %c", n, from_rod, to_rod); towerOfHanoi(n-1, aux_rod, to_rod, from_rod); } int main() { int n = 4; // Number of disks towerOfHanoi(n, 'A', 'C', 'B'); return 0; }
400
Posted By
Tower Of Hanoi
class Toh
{ 
    static void towerOfHanoi(int n, char
java tower of hanoi
Reshma
Program to print half pyramid using *
#include<stdio.h>
int main()
{
half pyramid c
Reshma
Program to print half pyramid using numbers
#include <stdio.h>
int main()
{
half pyramid using numbers c
Reshma
Armstrong Number in C
#include <stdio.h>
#include <math.h>
void main()
armstrong number c
Reshma
Program to print half pyramid using alphabets
#include <stdio.h>
int main()
{
pyramid alphabets c
Reshma
Inverted half pyramid using *
#include <stdio.h>
int main()
{
inverted pyramid c
Reshma
Program to Find Roots of a Quadratic Equation
#include <stdio.h>
#include <math.h>
int main()
roots of quadratic eon c
Reshma
GCD Using for loop and if Statement
#include <stdio.h>
int main()
{
gcd c
Reshma
GCD Using while loop and if...else Statement
#include <stdio.h>
int main()
{
gcd while c
Reshma
GCD for both positive and negative numbers
#include <stdio.h>
int main()
{
gcd c
Reshma
LCM using while Loop and if Statement
#include <stdio.h>
int main()
{
c lcm
Reshma
LCM Calculation by Finding GCD
#include <stdio.h>
int main()
{
c lcm using gcd
Reshma
Sum of Natural Numbers Using Recursion
#include <stdio.h>
int addNumbers(int n);
int main()
c sum of numbers
Reshma
Display Prime Numbers Between two Intervals
#include <stdio.h>
int main()
{
interval c prime
Reshma
Integer as a Sum of Two Prime Numbers
#include <stdio.h>
int checkPrime(int n);
int main()
prime numbers integer sum c
Reshma