勒让德多项式的递归算法:
#include <stdio.h>
#include <stdlib.h>
float fib(int n,int x)
{
if (n == 0)
{
return 1;
}
else if (n == 1)
{
return x;
}
else
{
return ((2 * n - 1) * x - fib(n - 1 , x) - (n - 1) * fib(n - 2, x)) /n; //递归的运算步骤
}
}
int main()
{
int n,x;
float result; //定义一个结果变量
printf("please inputa n,x:");
scanf("%d,%d",&n,&x);
result = fib(n,x);
printf("the result is : %f\n",result);
system("pause");
return 0;
}
运行效果: