01 - Fibonacci e fatorial

Esta é uma pré-visualização de arquivo. Entre para ver o arquivo original

/*
NOME: Thiago de Jesus Pereira 
MAT: 200620541711
Calculo de Fibonacci para 10,20,30 .. 100
RESULTADOS:
Fibonacci de 10 = 55.00 -> Chamadas recursivas: 177
Fibonacci de 20 = 6765.00 -> Chamadas recursivas: 21891
Fibonacci de 30 = 832040.00 -> Chamadas recursivas: 2692537
Fibonacci de 40 = 102334155.00 -> Chamadas recursivas: 331160281
Fibonacci de 50 = 12586269025.00 -> Chamadas recursivas: 2075316483
Observacoes: Nao obtive resultados a partir do fibonacci de 50.
*/	
#include <stdio.h>
#include <stdlib.h>
int recursivo =0;
double fibonacci(long p){
 	recursivo++;
	if(p<=1){
		return p;
	}else{
		return fibonacci(p-1) + fibonacci(p-2);
	}
}
void main(){
	int i;
	for(i=10;i<=100;i+=10){
		printf("Fibonacci de %d = %lf",i,fibonacci(i));
		printf(" -> Chamadas recursivas: %d \n",recursivo);
		recursivo =0;
	}
}
/*
NOME: Thiago de Jesus Pereira 
MAT: 200620541711
Calculo de Fatorial para 10,20,30 ... 100
RESULTADOS:
Fatorial de 10 = 3628800.00 -> Chamadas recursivas: 11
Fatorial de 20 = 2432902008176640000.00 -> Chamadas recursivas: 21
Fatorial de 30 = 265252859812191030000000000000000.00 -> Chamadas recursivas: 31
Fatorial de 40 = 815915283247897680000000000000000000000000000000.00 -> Chamadas recursivas: 41
Fatorial de 50 = 30414093201713376000000000000000000000000000000000000000000000000.00 -> Chamadas recursivas: 51
Fatorial de 60 = 8320987112741391600000000000000000000000000000000000000000000000000000000000000000.00 -> Chamadas recursivas: 61
Fatorial de 70 = 11978571669969890000000000000000000000000000000000000000000000000000000000000000000000000000000000000.00 -> Chamadas recursivas: 71
Fatorial de 80 = 71569457046263779000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.00 -> Chamadas recursivas: 81
Fatorial de 90 = 1485715964481760700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.00 -> Chamadas recursivas: 91
Fatorial de 100 = 93326215443944102000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.00 -> Chamadas recursivas: 101
*/	
#include <stdio.h>
#include <stdlib.h>
int recursivo =0;
double fatorial(long p){
 recursivo++;
	if(p==0){
		return 1;
	}else{
		return fatorial(p-1) * p;
	}
}
void main(){
	int i;
	for(i=10;i<=100;i+=10){
		printf("Fatorial de %d = %.2lf",i,fatorial(i));
		printf(" -> Chamadas recursivas: %d \n",recursivo);
		recursivo =0;
	} 
}