Re^5: Algorithm for cancelling common factors between two lists of multiplicands

I think the canceling code should stay, because it's faster to toss out matching terms than to multiply and then divide them out.

Care to run a benchmark with and without?

-QM
--
Quantum Mechanics: The dreams stuff is made of

Comment on Re^5: Algorithm for cancelling common factors between two lists of multiplicands

Replies are listed 'Best First'.
Re^6: Algorithm for cancelling common factors between two lists of multiplicands by BrowserUk (Patriarch) on Aug 13, 2005 at 01:55 UTC
See Re^6: Algorithm for cancelling common factors between two lists of multiplicands (192.5 ms). Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal? "Science is about questioning the status quo. Questioning authority". The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.	[reply]

Replies are listed 'Best First'.

Re^6: Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk (Patriarch) on Aug 13, 2005 at 01:55 UTC

See Re^6: Algorithm for cancelling common factors between two lists of multiplicands (192.5 ms).

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?

"Science is about questioning the status quo. Questioning authority".

The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.

[reply]