Re^3: better union of sets algorithm?

so, for example (to clarify):

my @a = qw( 1 2 3 3 2 );
my @b = qw( 1 4 5 5 4 );
my @c = qw( 1 6 7 7 6 );
[download]

should give back

1 2 3 4 5 6 7
[download]

right? basically you could make one big list and find the uniques from that?

--------------
It's sad that a family can be torn apart by such a such a simple thing as a pack of wild dogs

Comment on Re^3: better union of sets algorithm? Select or Download Code

Replies are listed 'Best First'.
Re^4: better union of sets algorithm? by perrin (Chancellor) on Mar 11, 2005 at 15:32 UTC
That's right, except the lists are sets, i.e. they have no dupes internally, and they are already individually sorted.	[reply]