Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?

Re (tilly) 1: Sort on boredom

by tilly (Archbishop)
on Mar 23, 2001 at 18:09 UTC ( #66623=note: print w/ replies, xml ) Need Help??

in reply to Sort on boredom

Only inefficiently. If you don't tell Perl to build a hash lookup, you will have to repeatedly scan the array. But you can eliminate the Schwartzian sort:

use strict; use Data::Dumper; $Data::Dumper::Indent = 1; my @vals = qw( 1 2 3 1 3 3 3 43 bob 2 bob 6 2 ); my %freqs; $freqs{$_}++ foreach @vals; my @sorted = sort { $freqs{$b} <=> $freqs{$a} or $a cmp $b } keys %freqs; print Data::Dumper->Dump([\@sorted], ['*sorted']);
Remember that Schwarzian sorts are good when the sort step involves a lot of work. Hash lookups are not that much work. :-)

Incidentally note that way I dump. I had looked that up a long time ago, but I want to start trying to use that for brief one-offs. I think it is rather nice to keep my names intact like that...

Comment on Re (tilly) 1: Sort on boredom
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (3)
As of 2015-11-28 17:51 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (743 votes), past polls