merlyn had probably the most simple solution. I, however, like the creative solution. AoH or Hash based solutions are obvious. How's this for a unique method:
my @a = qw(fred bob john peter);
my @b = ( 2, 1, 4, 3 );
my @a_sorted = @b_sorted = ();
push( @{ ($|-- ? \@b_sorted : \@a_sorted ) }, $_ ) for
map { @$_ }
sort { $a->[1] <=> $b->[1] }
map { [ $a[$_], $b[$_] ] } (0 .. $#b);
print " $a_sorted[$_] => $b_sorted[$_] \n" for ( 0 .. $#b_sorted );
The one thing that I don't like about this is that it does not sort in place. It requires the creation of two new sorted arrays. :-(
Ivan Heffner
Sr. Software Engineer, DAS Lead
WhitePages.com, Inc.
-
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.
|