Ok, I've reduced it to this :-)
sub sort_n {
return
map {
$_->[0]
}
sort {
my $l = @{$a->[1]} < @{$b->[1]} ? @{$a->[1]} : @{$b->[1]};
for (my $n=0; $n<$l; $n++) {
my $A = $a->[1][$n];
my $B = $b->[1][$n];
my $tmp;
if ($A =~ /\d/) {
if ($B =~ /\d/) { $tmp = $A <=> $B; }
else { $tmp = -1; }
} else {
if ($B =~ /\d/) { $tmp = 1; }
else { $tmp = $A cmp $B; }
}
return $tmp if $tmp;
}
return @{$a->[1]} <=> @{$b->[1]};
}
map {
[ $_ , [ split( /(\d+)/, $_ ) ] ]
}
@_;
}
-
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.
|