用递归求勒让德公式

#include<stdio.h>
double p(int n,double x);
int main()
{
int n;
double x,y;
printf(“请输入n和x：”);
scanf("%d %lf", &n ,&x);
y=p(n, x);
printf("%lf",y);
return 0;
}

double p(int n,double x)
{
double z = 0;
if (n == 0)
z= 1;
else if (n == 1)
z= x;
else if (n > 1)
{
z= ((2 * n - 1)*x - p(n - 1,x) - (n - 1)*p(n - 2, x)) / n;
}
return z;
}