comment on

Here is a faster solution, using a hash slice:

use Benchmark qw(:all) ;

my @a;
push @a, int (rand(10)) foreach 1..100;
my %unique;
my @awd;
cmpthese($1000, {
                  'jc' =>
                  sub { foreach my $thingy (@a) { $unique{$thingy} = 1
+; }
                        @awd = keys %unique;
                     },
                  'mk' =>
                  sub { @unique{ @a} = 1;
                        @awd = keys %unique;
                     },
                 });
[download]

The results are

Benchmark: running jc, mk for at least 3 CPU seconds...
        jc:  3 wallclock secs ( 3.14 usr +  0.00 sys =  3.14 CPU) @ 53
+5.67/s (n=20522)
        mk:  4 wallclock secs ( 3.27 usr +  0.00 sys =  3.27 CPU) @ 14
+937.00/s (n=48844)
      Rate   jc   mk
jc  6536/s   -- -56%
mk 14937/s 129%   --
[download]

Update: $1000 is a typo should be 1000. I'll keep it as is for comparisons with the following nodes. Thanks BrowserUK and tilly!

-Mark

In reply to Re: Find unique elements in an array by kvale
in thread Find unique elements in an array by jcpunk

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.


Your skill will accomplish what the force of many cannot
	PerlMonks