Update: Originally solved the wrong problem. This version may be computationally simple enough that the ST suggested by others is unnecessary.
print sort {
if (($a=~/^[a-z]/) == ($b=~/^[a-z]/)) { $a cmp $b }
else { $b cmp $a }
} @needs_sorting;
If the initial letters are the same case, sort normally
If not, sort reverse (putting the lower first).
Further update: I liked Broquaint's way of checking initial case.
The PerlMonk tr/// Advocate
-
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.
|