Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

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.


Comment on Re: An APL trick for the Schwartzian Transform
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (7)
As of 2014-12-22 02:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (110 votes), past polls