Come for the quick hacks, stay for the epiphanies. | |
PerlMonks |
Re^5: Algorithm for cancelling common factors between two lists of multiplicandsby QM (Parson) |
on Aug 12, 2005 at 23:03 UTC ( [id://483452]=note: print w/replies, xml ) | Need Help?? |
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
In Section
Seekers of Perl Wisdom
|
|