What method of comparison is the fastest and least straining on memory if each of the strings were at least 1,000 unique values in length?"
Which many problems, you will have to make a trade-off. Do you go for speed, or do you go for less memory. More often than not, there isn't an algorithm that is both the fastest, and uses the least memory.

It's entirely possible to use an algorithm that uses O(1) memory (not counting disk space). It will be the least straining on memory - but it's not the fastest. Fastest will be to put the strings of one set in a hash, and checking with the other set. But that uses more memory.

So, make your pick. The least straining on memory, or the fastest. You cannot have both.

In reply to Re: Iterating through Two Arrays. Is there a better use of memory? by JavaFan
in thread Iterating through Two Arrays. Is there a better use of memory? by Jeri

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.