searching a list, i always like binary search. of course, the list has to be sorted tough. here is a little script

use strict;
use warnings;

my @s = ( 'abc', 'dog', 'cat', 'rabbit', 'attic' );
my @sorted_copy = sort { $a cmp $b } @s;

print ' at:' . contains_string( 'at',  \@sorted_copy ) . "\n";
print 'cat:' . contains_string( 'cat', \@sorted_copy ) . "\n";

sub contains_string {
    my ( $var, $array ) = @_;

    return binary_string_search( $var, $array ) > -1;
}

sub binary_string_search {
    my ( $var, $array, $lo, $hi ) = @_;

    $lo = 0 unless defined $lo;
    $hi = $#{ @{$array} } unless defined $hi;

    while ( $lo <= $hi ) {

        # determine new division point
        my $mid = $lo + int( ( $hi - $lo ) / 2 );

        if ( $array->[$mid] eq $var ) {
            return $mid;
        }
        elsif ( $var le $array->[$mid] ) {
            $hi = $mid - 1;
        }
        else {
            $lo = $mid + 1;
        }        
    }

    # nothing found
    return -1;
}
[download]

i think you can achieve a speedy solution when searching a big list for more than one item.

UPDATE: minor code changes.

---

---

• 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.