Jeff Pang wrote:
>>Yes, the FAQ answer is more efficient.  Using Big O notation[1], the FAQ's
>>solution is O(n) and your's is O(n**2)
> 
> where is the FAQ?sorry I never knew it.

perldoc -q "How do I compute the intersection of two arrays"


John
-- 
use Perl;
program
fulfillment

-- 
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
<http://learn.perl.org/> <http://learn.perl.org/first-response>


Reply via email to