in reply to Underestimage (ST vs brute force)

Providing the following just because I'm slow and it might help someone else as well. I had to reformat your code in order to "see" it ;) and added some comments just because.

my @s = map { $_->[1] } # get back the original value ( +$_ from the third step in the map) sort { $a->[0] <=> $b->[0] } # sort on $1 from below map { $c += 1; # count the regexs /(\d+)/; # put the digits from $_ into $ +1 [ $1, $_ ] # store $1, and $_ for later re +trival } @l;

I liked the benchmarking code too, very nice setup. ;)


___________
Eric Hodges