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

Re(2): (tye): The Ovidian Transform

by dmmiller2k (Chaplain)
on Dec 31, 2001 at 23:21 UTC ( #135417=note: print w/ replies, xml ) Need Help??


in reply to (tye)Re: The Ovidian Transform
in thread The Ovidian Transform

Good one, tye. I've had great success with your second alternative, prepending the sort key to the original data, making a single string and sorting that.

It has been at *least* 50% faster than the "standard" ST technique, in the instances where I've used it (your mileage may vary, of course :). Mostly, those instances were cases where the data was complex enough that sorting was slow to begin with...

Update: While this approach probably cannot compete with the raw speed of C, the cost-benefit ratio is far more favorable (to me), given the size of the learning curve I would require in order to be effective using XS (which is essentially what using C in this context boils down to).

dmm

You can give a man a fish and feed him for a day ...
Or, you can
teach him to fish and feed him for a lifetime


Comment on Re(2): (tye): The Ovidian Transform

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (8)
As of 2015-07-07 06:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (87 votes), past polls