Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Re: best practice

by dragonchild (Archbishop)
on Aug 27, 2001 at 19:59 UTC ( [id://108158]=note: print w/replies, xml ) Need Help??


in reply to Re: best practice
in thread best practice

To harp on something here ... 99% of the time optimizations are done, it's usually a case of premature optimization.

The basic rule of thumb is that if you cannot back up your desire to optimize with hard data, then DON'T! You will make your code completely unmanageable, usually for only a few micro-seconds of gain - completely unnoticeable to the user.

------
/me wants to be the brightest bulb in the chandelier!

Vote paco for President!

Replies are listed 'Best First'.
Re: Re: Re: best practice
by hsmyers (Canon) on Aug 27, 2001 at 22:03 UTC
    Clearly your mileage may vary, but the difference between inner loops written in 'C' or higher compared to assembler (and optimized assembler at that) is way significant if you are talking about number crunching. Typically I sin in such a fashion when I'm generating fractals and such like. Being greedy, I will use any trick I can in order to bitblit a little faster!

    hsm

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others romping around the Monastery: (4)
As of 2024-04-19 13:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found