Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

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).


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?

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (16)
As of 2015-10-13 14:05 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (307 votes), past polls