in reply to Sort problem

@in = { @out = { qw[M N], qw[C B A], qw[M N Q P O], qw[C G F E D], qw[C B A], qw[C G F H], qw[U S], qw[C G F H I], qw[V T], qw[C G F H J], qw[C G F E D], qw[M K], qw[C G F H], qw[M N], qw[C G F H I], qw[M N Q P O], qw[C G F H J], qw[U S], qw[M K], qw[V T], }; };
Well, first off, that's no where near an array of arrays. You've got an array taking a single element which is a hashref pointing to an anonymous hash, constructed by taking alternating pairs of values, like:
@in = ({ M => 'N', M => 'N', Q => 'P', O => 'C', ... });
So, if you started with that, you definitely need to figure out how to write your original problem first.

I could recommend perllol or perldsc as starting points.

-- Randal L. Schwartz, Perl hacker
Be sure to read my standard disclaimer if this is a reply.

Replies are listed 'Best First'.
Re: •Re: Sort problem
by tachyon (Chancellor) on Feb 26, 2003 at 19:39 UTC

    You missed this opportunity so I had to post it for you here We know what BrowserUK meant and as he posts quality answers and interesting questions I reckon HWIWHM is the go rather than giving him a RTFM.

    cheers

    tachyon

    s&&rsenoyhcatreve&&&s&n.+t&"$'$`$\"$\&"&ee&&y&srve&&d&&print

Re: •Re: Sort problem
by BrowserUk (Patriarch) on Feb 26, 2003 at 21:26 UTC

    Your right of course. I should have taken more care when writing up my question. I printed the output from the AoA and then wrapped it up to suggest the structure but made a mess of it.


    ..and remember there are a lot of things monks are supposed to be but lazy is not one of them

    Examine what is said, not who speaks.
    1) When a distinguished but elderly scientist states that something is possible, he is almost certainly right. When he states that something is impossible, he is very probably wrong.
    2) The only way of discovering the limits of the possible is to venture a little way past them into the impossible
    3) Any sufficiently advanced technology is indistinguishable from magic.
    Arthur C. Clarke.