主程序.cpp

勒让德多项式递规算法

#include<iostream.h>
long returndriver(int x,int n){
	if(n==0)return 1;
	else if(n==1)return x;
	else return (((2*n-1)*x*returndriver(x,n-1)-(n-1)*x*returndriver(x,n-2))/n);
}
void main(){
	int n,x;
	cout<<"请输入勒让德多项式的基数"<<endl;
	cin>>x;
	cout<<"请输入勒让德多项式的次数"<<endl;
	cin>>n;
	long answer;
	answer=returndriver(x,n);
	cout<<"结果是"<<answer<<endl;
}