Hermite Polynomials(厄密多项式)是这样定义的:
n<=0: 1
Hn(x)= n=1: 2x
n>=2: 2xHn-1(x)-2(n-1)Hn-2(x)
编写递归函数,函数应该和下面的函数原型匹配:
int hermite(int n, int x)
代码如下:
#include<stdio.h>
int hermite(int n, int x)
{
int result;
if(n<=0)
{
result = 1;
}
else if(n=1)
{
result = 2*x;
}
else if(n>=2)
{
result = 2*x*hermite(n-1,x)-2*(n-1)*hermite(n-1,x);
}
return result;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
printf("%d\n",hermite(m,n));
return 0;
}