Your sort can be faster if you move the substr out of the sort routine and into a map, then peice it back together afterword. This is known as the "Schwartzian Transform":
my @data = map { $_->[1] } sort { $a->[0] <=> $b->[0] } map { [ substr($_,1), $_ ] } @tempArray;
Or, since your data is a simple string, it shouldn't be too much of a problem to modify that string in the first map (counting in the order of execution) and thus eliminate the need for the middle sort block (which is called the GMT GRT (thanks Abigail-II)):
my @data = map { s/\A (.*)(.) \z/$2$1/x } sort map { s/\A (.)(.*) \z/$2$1/x } @tempArray;
Using perl's internal sort should be faster than making it continually call a custom block.
----
I wanted to explore how Perl's closures can be manipulated, and ended up creating an object system by accident.
-- Schemer
: () { :|:& };:
Note: All code is untested, unless otherwise stated
In reply to Re: Sorting a subset
by hardburn
in thread Sorting a subset
by seaver
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |