Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: sorting array of arrays reference

by salva (Abbot)
on Oct 26, 2013 at 16:46 UTC ( #1059824=note: print w/replies, xml ) Need Help??


in reply to sorting array of arrays reference

A concise O(N) solution:
my @top = @masterArray[0..2]; @top = (sort { $b->[2] <=> $a->[2] } @top, $masterArray[$_])[0..2] for + 3..$#masterArray;
Though, I have no idea how fast it would be.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1059824]
help
Chatterbox?
[Corion]: Nicholas Clark++ # read for a multichar block-delimiter by scanning for the last char, and only then check whether the whole delimiter was read.
[Corion]: At least if you're appending the data read to a larger buffer, this means you avoid the situation of "a delimiter was found but the other half has not been read yet"
choroba misses the context
[Corion]: choroba: Optimizing how Perl reads source code on startup (and then processes it line-by-line)
[Corion]: But in general, it seems to be an interesting approach I should think about - whenever I'm searching for something, to consider if I could search for the end of the token instead of the start of the token

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (12)
As of 2016-12-06 15:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (107 votes). Check out past polls.