Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Re: "Intelligent" array joining

by ngomong (Sexton)
on Feb 05, 2004 at 22:22 UTC ( #326912=note: print w/replies, xml ) Need Help??

in reply to Re: "Intelligent" array joining
in thread "Intelligent" array joining

Hmmm... this appears to be a step in the right direction, though I don't need that "sort" in there. You see, numerical order is of no importance... only the order in which it appears in the array. It's like this:

my @array1 = (1, 3, 4, 6); my @array2 = (1, 2, 4, 6); my @array3 = (1, 2, 3, 5);
So, the program looks as the first array, and notes its order. Then, it looks at the second array, and notices that "2" hasn't been seen before. It notes that it goes after "1" and before "4". At this point, the logical order could be either

(1, 2, 3, 4, 6) or
(1, 3, 2, 4, 6)

It doesn't matter which it chooses. Then, it examines the third array and realizes that "2" comes before "3". Plus, the "5" is new, and comes after "3". So, now the order could be:

(1, 2, 3, 4, 5, 6) or
(1, 2, 3, 4, 6, 5)

Does that make sense?

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (4)
As of 2020-07-06 23:53 GMT
Find Nodes?
    Voting Booth?

    No recent polls found