comment on

Here's one approach, using a Schwartzian Transform:

sub parse {
  my $item = shift;
  return [ $item, $item =~ /^(\d+)([a-zA-Z]*)/ ];
}

sub sort_alphanum {
  $a->[ 1 ] <=> $b->[ 1 ] or
  $a->[ 2 ] cmp $b->[ 2 ];
}

my @sorted =
  map $_->[ 0 ],
  sort sort_alphanum
  map parse( $_ ), @old;
[download]

It's only merit (if any), relative to the other solutions posted, is that it illustrates a relatively general approach to this type of problem. It's most useful when the extraction of the parameter(s) to sort by (in this case, the job done by the parse sub) is costly.

the lowliest monk

In reply to Re: Sorting Alphanumeric Arrays by tlm
in thread Sorting Alphanumeric Arrays by slloyd

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.


Your skill will accomplish what the force of many cannot
	PerlMonks