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


more useful options
	PerlMonks

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

by salva (Canon)

on Aug 08, 2005 at 19:55 UTC ( #482000=note: print w/replies, xml )

Need Help??

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

$i{$_}++ for (@a);
$i{$_}-- for (@b);

@c=grep { $i{$_} > 0 } keys @a;
@d=grep { $i{$_} < 0 } keys @b;
[download]

btw, are your sample solution arrays right?

Comment on Re: Algorithm for cancelling common factors between two lists of multiplicands Download Code

Replies are listed 'Best First'.

Re^2: Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk (Patriarch) on Aug 08, 2005 at 19:57 UTC

This is not intersection of arrays!

btw, are your sample solution arrays right?

Yes!

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]

In Section Seekers of Perl Wisdom

Domain Nodelet^?

www.com | www.net | www.org

Node Status^?

node history
Node Type: note [id://482000]
help

Chatterbox^?

How do I use this? | Other CB clients

Other Users^?

Others perusing the Monastery: (8)

As of 2023-03-20 12:35 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

Notices^?