README.md

December 5, 2022 ยท View on GitHub

recursive functions

Description

Some functions to show the use of recursion in programming. This contains Fibonacci,Towers of Hanoi,Ackermann function

More Info

Submitted On
ByCallens Bob
LevelBeginner
User Rating4.0 (8 globes from 2 users)
CompatibilityC, C++ (general)
CategoryMath
WorldC / C++
Archive File

Source Code

//Towers of Hanoi
//example: you have 4 disks and have to move all disks from 1 to 3. solve(4,1,3,2);
void solve(int disks, int src,int dest, int stack)
{

if(disks==1)
{
printf("Move from %d to %d\n",src,dest);
}
else {

solve(disks-1,src,stack,dest);
solve(1,src,dest,stack);
solve(disks-1,stack,dest,src);
}
}
//Fibonacci numbers
int fab(int n)
{
if(n==1 || n==2)
{
return 1;
}
else
return (fab(n-1)+fab(n-2));
}
//ackermann function
int ack(int m,int n)
{
if(m==0)
{
return n+1;
}

if(n==0)
{
return ack(m-1,1);
}
else
return ack(m-1,ack(m,n-1));
}