in reply to Re^4: Algorithm for cancelling common factors between two lists of multiplicands
in thread 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
In Section
Seekers of Perl Wisdom