Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

•Re: Pair of items

by merlyn (Sage)
on Jul 30, 2003 at 14:04 UTC ( #279186=note: print w/replies, xml ) Need Help??


in reply to Pair of items

If you know the items are always sorted, there's a routine that's likely to be faster than anything else shown here as I post this:
my $ok = no_common_item_in_these_numeric_sorted_lists( [1, 2, 3], [2, 4, 6] ); sub no_common_item_in_these_numeric_sorted_lists { my @x = @{+shift}; # these are copies my @y = @{+shift}; ## presuming numeric sorted while (@x or @y) { shift @x, next if not @y or $x[0] < $y[0]; shift @y, next if not @x or $x[0] > $y[0]; return 0; # not ok - we found an identical item } return 1; # ok - we found no identical items }

-- Randal L. Schwartz, Perl hacker
Be sure to read my standard disclaimer if this is a reply.

Replies are listed 'Best First'.
Re: &bull;Re: Pair of items
by Simpleton (Initiate) on Jul 31, 2003 at 07:12 UTC
    I believe that'd have to be:
    while (@x and @y) {
    Otherwise it goes into an infinite loop if every element in @x is less than every element in @y.
      No, if every element of @x is less than the first element of @y, then all of @x first gets nibbled element by element because of the first statement within the loop, then all of @y gets nibbled element by element because of the second statement within the loop, and then we drop out of the loop.

      Perhaps you're arguing that I can optimize that to "and". Probably true. But it doesn't break even when it's an "or", unless I'm missing something.

      I constructed this loop by thinking about loop invariants, a very valuable tool. In this case, we know that no pair of equal numbers can ever get shifted off the lists, and yet we are shifting while we are looping, so we're always moving closer to either an equal pair, or two empty lists.

      -- Randal L. Schwartz, Perl hacker
      Be sure to read my standard disclaimer if this is a reply.

        Actually, it gets nibbled down by the first statement, and then keeps nibbling at the empty @x because $x[0] < $y[0] is true even if @x is empty. Feed the subroutine ([1,2,3], [4,5,6]) and it never exits.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (2)
As of 2023-01-31 04:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?