Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: Create unique array --the hard way!

by jethro (Monsignor)
on Mar 07, 2014 at 16:10 UTC ( [id://1077410]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Create unique array --the hard way!
in thread Create unique array --the hard way!

Great that you found a solution yourself

Since you didn't follow your own idea of using sorting to identify doubles the sort step is now useless.

To follow your original plan you would have to do something like this:

my $previous=""; foreach my $element ( @sorted_array_q3 ) { if ( $element ne $previous ) { push( @unique_array, $element ); } $previous= $element; }

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1077410]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2025-07-11 08:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.