|The stupid question is the question not asked|
Re^7: sort hash of arrays of arraysby BrowserUk (Pope)
|on Oct 31, 2012 at 16:44 UTC||Need Help??|
How does it work? Specifically, why does it need the "for keys %hash" part?
Because, as I said, you need to do one sort for each key.
(I don't know how better to explain it than that. )
How could I sort on the innermost elements (e.g. [26, 27, 28] to get [28, 27, 26]) using the same method?
Now you need to do one sort for each sub array, for each key, so you need nested loops:
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.