(递归)霍纳规则

#include <iostream>using namespace std;/*问题:霍纳规则是一种是用最少数目的乘法计算多项式的方法A(x) = ( ..( a.n*x + a.n-1)*x + ... + a.1)*x + a.0*/int Huona(int iArr[],int i,int x,int n){if(i == n-1)return iArr[i];elsereturn iArr[i] + x * Huona(iArr,i+1,x,n);}int main(){int iArr[] = {3,4,5};int iRes = Huona(iArr,0,3,3);cout<<iRes<<endl;return 0;}