This time Thomas explains the initial How To's for benchmarking your algorithms and methods -and includes two source code samples.
From Thomas post: "... If benchmarking shows your algorithm has problems without implementation optimizations, you are probably better off with a different algorithm. Which isn't to say that these sorts of optimizations aren't still useful. But it's better to do these selectively, once you have your code implemented and have profiled it to find specific problem areas. We'll look at how to use a profiler to find these problem areas next week, in Part 3 ...".Cannot wait for part 3 ... :)