fabonaqi.cpp

经典的斐波那其算法程序

#include<iostream.h>
#include<stdio.h>

int fabo(int n)
{	int sum ;
	if(n == 1)
		return 1 ;
	else if(n == 2)
		return 1 ;
	else
	{
		sum = fabo(n-1) + fabo(n-2) ;
		return sum ;
	}
}

void main()
{
	int n, fibo ;
	cout << "please anter an integer number: " << endl ;
	cin >> n ;
	cout << "斐伯那岐数列————————" << endl ;

	
	for(int i=0; i < n; i++)
	{
		fibo = fabo(i) ;
		printf("%4d", fibo) ;
		if(i%10 == 0)
			printf("\n") ;
	}
	
}