Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Sorting multiple arrays

by Codon (Friar)
on Sep 13, 2005 at 16:09 UTC ( #491615=note: print w/replies, xml ) Need Help??


in reply to Sorting multiple arrays

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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://491615]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (10)
As of 2017-02-23 11:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Before electricity was invented, what was the Electric Eel called?






    Results (345 votes). Check out past polls.