|
|
|
| Don't ask to ask, just ask | |
| PerlMonks |
Re^2: Algorithm for cancelling common factors between two lists of multiplicandsby BrowserUk (Patriarch) |
| on Aug 08, 2005 at 19:48 UTC ( [id://481992]=note: print w/replies, xml ) | Need Help?? |
|
Will the arrays have equal numbers of values? Unimportant. Will there be repeated values in teh individual arrays (1, 1, 10, 20, ...)? Possibly. Could the arrays fit in (virtual) memory or are they disk based and too big? They will fit in memory. 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.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||