comment on

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;
[download]

--Dave

In reply to Re: Interchanging hash values by dpuu
in thread Interchanging hash values by mjab

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.


Perl-Sensitive Sunglasses
	PerlMonks