Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Underestimage (ST vs brute force)

by brian_d_foy (Abbot)
on Dec 11, 2008 at 20:06 UTC ( #729774=note: print w/replies, xml ) Need Help??

in reply to Underestimage (ST vs brute force)

I would expect the Schwartzian Transform to be slower when the number of items is small, the computation of the secondary key is very easy, and maybe in some pathological cases. That's how we teach it in our "Intermediate Perl" class; we make the students benchmark it. It's the subject of Wasting time thinking about wasted time.

Uri Guttman and Larry Rosler spent a lot of time thinking about sorting and wrote a nice paper on the subject that includes about every method they could find.

brian d foy <>
Subscribe to The Perl Review

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://729774]
and !@monks...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (6)
As of 2017-11-25 11:48 GMT
Find Nodes?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:

    Results (355 votes). Check out past polls.