Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re: Interchanging hash values

by dpuu (Chaplain)
on Apr 20, 2003 at 01:35 UTC ( [id://251754]=note: print w/replies, xml ) Need Help??


in reply to Interchanging hash values

The other solutions are nice, but if you want a more efficient algorithm then it is indeed possible to avoid the sort. An O(N) algorithm is:
#!/usr/bin/perl -w use strict; use Data::Dumper; my %hash = ( Matt => 24, Dana => 19, Eric => 28, Sara => 20, John => 17, Mi +ke => 23, ); if (%hash) { my (@min, @max); while( my ($k,$v) = each %hash ) { @min = ($k,$v) unless @min && ($v > $min[1]); @max = ($k,$v) unless @max && ($v < $max[1]); } $hash{$min[0]} = $max[1]; $hash{$max[0]} = $min[1]; } print Dumper \%hash;
--Dave

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others contemplating the Monastery: (5)
As of 2024-04-25 18:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found