Recursive method
/*
==================================================================
Title: F (x,1) =1
F (x,n) =f (2x+1,n-1) *x (n>1)
==================================================================
*/
#include <stdio.h>
Double F (float x,int N)
{
if (n==1) return 1;
else if (n>1)
Return F (2*x+1,n-1) *x;
}
void Main ()
{
int n;
float x,p;
printf ("x=");
scanf ("%f", &x);
printf ("n=");
scanf ("%d", &n);
P=f (X,n);
printf ("F (%.2f,%d) =%.2lf\n", x,n,p);
}
/*
======================================================================
Evaluation:
This example two parts the powerful recursive method, as long as there is a recursive formula, everything will change eazy!
========================================================================
*/
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
function Call of C language 16-Call of the general function of recursive method
