See perldata, perllol and perlfunc (for map and sort).

my @AoA = (
    [ 'foo' , 1 ],
    [ 'bar' , 5 ],
    [ 'buz' , 3 ],
);

print "@$_\n" for sort { $a->[1] <=> $b->[1] } @AoA;

@AoA = (); #free structure
[download]

Can I do it like this, since I don't know what the string is going to be just there order. my @AoA = ( $string1 , 1 , $string2 , 5 , $string3 , 3 , ); print "@$_\n" for sort { $a->1 <=> $b->1 } @AoA; @AoA = (); #free structure

    my @things;
    push @things, [ $string, $index ]; # as many times as necessary
    for ( sort { $a->[1] <=> $b->[1] } @things ) {
        # do whatever with it, e.g. print:
        print "Index: $_->[1]    String: $_->[0]\n";
    }
[download]

jdporter
...porque es dificil estar guapo y blanco.

I don't understand your question. The main advantage of an array, other than simple aggregation, is that you access it by index in the order it was created. In that sense, it is already sorted by index.

Could you give us a bit more information to go on about what you want to do?

There are so many ways to interpret what you have asked, any solution offered would be nothing more than a guess as to your real requirements.

Hi, Iam reading a text file and greping for certain strings and outputing them to a new file. In the text files there are the following string: apple plum cherry orange I want to match for these words and print them out to a file like this: plum|apple|orange|cherry To do this I need to assign a number to each string and then resort these numbers to resort the string. Creating a two dimensional array I think will do this. --kirk

use strict;

my $AoA = [[1, "apple"], [4, "pear"], [2, "plum"], [3, "orange"]];
print join("|", map {$_->[1]} sort {$a->[0] <=> $b->[0]} @{$AoA});
[download]