question about polynomial multiplication

Posted by davit-datuashvili on Stack Overflow See other posts from Stack Overflow or by davit-datuashvili
Published on 2010-05-23T09:54:53Z Indexed on 2010/05/23 10:00 UTC
Read the original article Hit count: 301

Filed under:
|

i know that horners method for polynomial pultiplication is faster but here i dont know what is happening here is code

public class horner{

  public static  final  int n=10;
  public static  final  int x=7;

  public static void main(String[] args){
    //non fast version
    int a[]=new int[]{1,2,3,4,5,6,7,8,9,10};
    int xi=1;
    int y=a[0];
    for (int i=1;i<n;i++){
      xi=x*xi;
      y=y+a[i]*xi;
    }
    System.out.println(y);
    //fast method
    int y1=a[n-1];
    for (int  i=n-2;i>=0;i--){
      y1=x*y+a[i];
    }

    System.out.println(y1);
  }

}

result of this two methods are not same result of first method is

462945547

and result of second method is

-1054348465

please help

© Stack Overflow or respective owner

Related posts about java

Related posts about algorithm