This works whether the arrays contain duplicate elements or not:
my %a = map { $_ => 1 } @a; my %b = map { $_ => 1 } @b; @c = grep { !$b{$_} } @a; @d = grep { !$a{$_} } @b;
In reply to Re^2: Algorithm for cancelling common factors between two lists of multiplicands
by ikegami
in thread Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |