in reply to Re^4: Benchmark, -s versus schwartzian (vs hash)
in thread Benchmark, -s versus schwartzian
The node you've mentioned actually uses an even faster form of the Schwartzian transform I've completely forgot about.
Thus, I've added it to my benchmark too:
sub sort_arr { my @h = map -s, @all; @results = @all[sort {$h[$a]<=>$h[$b]} 0..@h-1]; }
The results are amazing: this form is about 1.5 times as efficent than any of the other ones.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^6: Benchmark, -s versus schwartzian (vs hash)
by Aristotle (Chancellor) on Aug 23, 2004 at 15:58 UTC |
In Section
Seekers of Perl Wisdom