…is as important as knowing how to optimize.
In this thread  on the Delphi forums Ante Bonic brought back to intention this excellent Delphi Optimization Guide  in Delphi article by Robert Lee. The article has aged a bit, but many tips remain true with the Delphi 2009 compiler (sadly so).
Like many optimization articles, Robert’s focuses on mostly local optimization tips, which can draw in warnings like this one one by Anders Isaksson :
Optimization should be done after profiling, not before.
Which I couldn’t agree more with. But to be fair, Robert’s states so  in his article, as do most authors of optimization articles. Recipes and local optimization tips are to be used after all algorithmic and data structures improvements have been taken advantage off.
If one can list tips and tricks for local optimization, do’s and don’ts that are true often enough to be good tips in many scenarios. However, it’s practically impossible to come up with a “reusable” list of tips for algorithms and data structures. Too many specifics can come together, even when the problems are similar, considerations of scale or reactivity can drastically influence architectural and algorithmic options.
Hence the most visible optimization recipes are often local optimization ones, but mostly because there are few global optimization recipes. You only have global optimization methodologies. But even these methodologies can usually be summarized with few words:
- Time, profile, analyze and confirm your bottlenecks.
- Improve algorithms & data structures.
- Exhaust 1 & 2 before looking at local optimizations, and then don’t forget 1.
To optimize efficiently, ie. not waste your time, you have to master the first point.
To optimize effectively, ie. not waste the machine time, you have to master the second.
And the third point you ask? It’s a razor’s edge, when applied effectively, it can be very efficient, with very few changes like in this case , but if not, it’s a good way to end up there . To be effective, local optimization has to be about taking care of hidden machinery, hidden shortcomings of the compiler, hidden algorithms and data-structures that get in the way.
I’ll close this post by quoting Robert Lee’s article on timing:
Timing code is generally called “profiling”. If you want to improve the performance of your code, you first need to know precisely what that performance is. Additionally, you need to re-measure with each change you apply to your code. Do not spend a single second twiddling code to improve performance until you have analytically determined exactly where the application is spending its time. I cannot emphasize this enough.