recursive functions

//Towers of Hanoi
<br>//example: you have 4 disks and have to move all disks from 1 to 3. solve(4,1,3,2);
<br>void solve(int disks, int src,int dest, int stack)
<br>{
<br><dd>	if(disks==1)
<br><dd>	{
<br><dd> printf("Move from %d to %d\n",src,dest);
<br><dd>	}
<br> else {
<br>	
<br><dd><dd>	solve(disks-1,src,stack,dest);
<br><dd><dd>	solve(1,src,dest,stack);
<br><dd><dd>	solve(disks-1,stack,dest,src);
<br><dd> }
<br>}
<br>//Fibonacci numbers
<br>int fab(int n)
<br>{
<br><dd> if(n==1 || n==2)
<br><dd>	 {
<br><dd><dd>	 return 1;
<br><dd>	 }
<br> <dd>else
<br><dd><dd>return (fab(n-1)+fab(n-2));
<br> 
}
<br>//ackermann function
<br>int ack(int m,int n)
<br>{
<br><dd>if(m==0)
<br><dd>{
<br><dd><dd>return n+1;
<br><dd>}
<br> 
<br><dd>if(n==0)
<br><dd>{
<br><dd><dd>return ack(m-1,1);
<br><dd>}
<br><dd>else
<br><dd><dd>	return ack(m-1,ack(m,n-1));
<br>}