AYUDA CON ESTO

pamela aguirre
27 de Mayo del 2006
serie fibonacci
torres de hanio
todos con resursividad

Noel Solw
27 de Mayo del 2006
// program k7a13.CPP - page 127
// recursion : Hanoi Towers.
// 28/10/2001
// written in Borland CPP ver 3.1

#include <conio.h>
#include <iostream.h>
#include <iomanip.h>

const char *col[] = {"column a","column b","column c"};
int counter;

unsigned int GetNum(char *x)
{
unsigned int num;
cout << endl;
cout << setw(17) << x << " = ";
cin >> num;
cout << endl;
return num;
} // GET NUM

void Move(int n,int source,int target)
{
cout << "[" << setw(2) << counter ++
<< "] move disk number " << n << " from " << col[source] << " to "
<< col[target] << endl;
} // MOVE

void Hanoi(int n,int source,int auxiliar, int target)
{
if(n == 1)
Move(n,source,target);
else
{
Hanoi(n-1,source,target,auxiliar);
Move(n,source,target);
Hanoi(n-1,auxiliar,source,target);
}
} // HANOI

void main()
{
clrscr();
cout << "recursion : Hanoi Towers."
<< endl << endl;
for(;;)
{
int n = GetNum("level");
if(n <= 0)
break;
counter = 1;
Hanoi(n,0,1,2);
}
cout << endl << "end of program - good bye ! ! !" << endl;
getch();
} // MAIN


Noel Solw
27 de Mayo del 2006
// program k7a5.CPP - page 123
// recursion : Fibonacci Numbers.
// 7/9/2001
// written in Borland CPP ver 3.1

#include <conio.h>
#include <iostream.h>
#include <iomanip.h>

unsigned int GetNum()
{
unsigned int num;
cout << setw(20) << " n = ";
cin >> num;
return num;
} // GET NUM

unsigned long Fibo(unsigned int n)
{
if(n <= 2)
return 1;
return Fibo(n-1) + Fibo(n-2);
} // FIBO

void main()
{
clrscr();
cout << "recursion : Fibonacci Numbers." << endl << endl;
unsigned int n = GetNum();
while(n)
{
cout << setw(20) << "fibo(" << n << ") = " << Fibo(n) << endl;
n = GetNum();
}
cout << endl << endl;
cout << "end of program - good bye ! ! !" << endl;
getch();
} // MAIN

/*
recursion : Fibonacci Numbers.

n = 1 fibo(1) = 1
n = 2 fibo(2) = 1
n = 3 fibo(3) = 2
n = 4 fibo(4) = 3
n = 5 fibo(5) = 5
n = 6 fibo(6) = 8
n = 7 fibo(7) = 13
n = 8 fibo(8) = 21
n = 9 fibo(9) = 34
n = 10 fibo(10) = 55
n = 11 fibo(11) = 89
n = 12 fibo(12) = 144
n = 20 fibo(20) = 6765
n = 0

end of program - good bye ! ! !
*/