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.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|