You could avoid repeated double-lookups with a Schwartzian
sort:
my @sorted_keys = map {$_->[0]}
sort {$a->[1] cmp $b->[1]}
map {[$_, $hash{$_}{this}]} keys %hash;
(Read it bottom to top and it will make more sense.)
This is more memory intensive, but doing the double
lookup in the sort block means that it happens
O(n * log(n)) times. Doing it in a
map means it only happens n times. (Where
n is the number of keys.)
-
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.
|