/* Fig. 5.15: fig05_15.c
	Recursive fibonacci function */
	#include <stdio.h>
	long fibonacci( long n );
	int main( void )
	{
	long result;
	long number;
	printf( "Enter an integer: " );
	scanf( "%ld", &number );
	result = fibonacci( number );
	printf( "Fibonacci( %ld ) = %ld\n", number, result );
	return 0;
	}
	long fibonacci( long n )
	{
	if ( n == 0 || n == 1 ) {
	return n;
	}
	else {
	return fibonacci( n - 1 ) + fibonacci( n - 2 );
	}
	}