Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

Re: An APL trick for the Schwartzian Transform

by Aristotle (Chancellor)
on Nov 16, 2002 at 02:28 UTC ( #213342=note: print w/replies, xml ) Need Help??

in reply to An APL trick for the Schwartzian Transform

Actually, if you’re at that point, you can make things a whole lot more efficient:

my @sorted = @unsorted[ do { my @cache = map key_from( $_ ), @unsorted; sort { $cache[$b] <=> $cache[$a] } 0 .. $#cache } ];

The Schwartzian Transform suffers severely from creating a huge number of tiny anonymous arrays. This form creates only one extra array and one extra list. The larger the array and the less expensive the key calculation routine, the larger the impact this will have.

Makeshifts last the longest.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://213342]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (4)
As of 2016-10-24 07:49 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (303 votes). Check out past polls.