Polynomial long division: Difference between revisions
Content added Content deleted
m (added notes to "allow" workinprogress octave (and ocaml?) impl, which use(s) the (alas!) better convention to keep the "highest" power coeff first) |
m (can / could, since anyway a single-pos shift makes it simpler/clearer than using subarrays (and indexes) instead) |
||
| Line 32: | Line 32: | ||
* Error handling (for allocations or for wrong inputs) is not mandatory. |
* Error handling (for allocations or for wrong inputs) is not mandatory. |
||
* Conventions can be different; in particular, note that if the first coefficient in the vector is the highest power of x for the polynomial represented by the vector, then the algorithm becomes simpler and shifting |
* Conventions can be different; in particular, note that if the first coefficient in the vector is the highest power of x for the polynomial represented by the vector, then the algorithm becomes simpler and shifting could be avoided. |
||
'''Example for clarification''' |
'''Example for clarification''' |
||