Re^9: Benchmark, -s versus schwartzian (smarter [sort])

Okay, fair enough - the allocation of all those arrays would probably hurt severely. Much better to do the sort-the-indexes trick you mention elsewhere in this thread, or the GRT variant mentioned in fast, flexible, stable sort.

But as for backwards compatibility - are you sure? Isn't the sorting of array references at this point essentially a random shuffle? (Meaning that it is unspecified, and could be different each time you run perl, not that it can be used in a situation where you actually need a random shuffle) Couldn't some order therefore be imposed upon it?

--
@/=map{[/./g]}qw/.h_nJ Xapou cets krht ele_ r_ra/;
map{y/X_/\n /;print}map{pop@$_}@/for@/
[download]

Comment on Re^9: Benchmark, -s versus schwartzian (smarter [sort]) Download Code