Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

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

by GrandFather (Sage)
on Aug 08, 2005 at 19:41 UTC ( #481989=note: print w/replies, xml ) Need Help??


in reply to Algorithm for cancelling common factors between two lists of multiplicands

Will the arrays have equal numbers of values?

Will there be repeated values in teh individual arrays (1, 1, 10, 20, ...)?

Could the arrays fit in (virtual) memory or are they disk based and too big?


Perl is Huffman encoded by design.
  • Comment on Re: Algorithm for cancelling common factors between two lists of multiplicands

Replies are listed 'Best First'.
Re^2: Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk (Pope) on Aug 08, 2005 at 19:48 UTC
    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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://481989]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (6)
As of 2019-10-18 20:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?