Notes

//Lab 3 Recursion

// Exp 1: To solve the recursion problels.
// 1. sum of first n natural numbers.
// 2. To find value of n!.
// 3. To find nth fibonacci number.
// 4. To find value of 1square + 2square + ....+ nspuare.
// 5. To find power(a, b).

// Exp 2. To solve TOH problem.
// Exp 3. To implement merge sort algorithm.

#include <stdio.h>
//program to print sum of n natural numbers using recursion

// int sumOfN(int n){
// if(n == 0){
// return 0;
// }
// else{
// return n+sumOfN(n-1);
// }
// }


// int main(){
// int n;
// printf("n Enter the number: n");
// scanf("%d", &n);
// printf("nSum of first %d natural number is %d", n,sumOfN(n));
// return 0;
// }

//Program to find n fibonacci number;

// int fibo (int n){
// if(n == 0)
// return 0;
// else if(n == 1)
// return 1;
// else
// return fibo(n-1) + fibo (n-2);
// }

// int main(){
// int n;
// printf("nEnter the numbern");
// scanf("%d", &n);
// printf("nFirst %d fibonacci numbers is %d",n, fibo(n));
// return 0;
// }

void TOH(int n, char A, char B, char C){
if(n>0){
TOH(n-1, A, C, B);
printf("n move %d from %c to %c", n, A, C);
TOH(n-1, B, A, C);
}
}

int main(){
int n;
char A = 'A', B = 'B', C = 'C';
printf("nEnter the number of disksn");
scanf("%d", &n);
TOH(n, A, B, C);
}