Sunday, April 10, 2005

Extension to Horner's rule

Horner's rule is used in computation to calculate polynomials using reduced multiplications. Please see the following references

  1. Eric W. Weisstein. "Horner's Rule." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/HornersRule.html
  2. http://planetmath.org/encyclopedia/HornersRule.html
The same rule can be extended and used for debugging. When you have "n" unknowns in debugging, your problem is a polynominal of degree "n". Solve the unknowns 1 by 1 as Horner's rule does for calculation of polynomials, by taking factors and converting the calculation to n multiplications and additions. Solving too many unknowns at once is complex, solve them one by one

No comments:

Ranking and Unranking permutations

I've been a big fan of Skiena's Algorithm Design Manual , I recently found my first edition of the book (although I own the third ed...