Timing repeated function calls

Malcolm Wallace Malcolm.Wallace@cs.york.ac.uk
Mon, 11 Aug 2003 11:14:54 +0100

"Jeffrey A. Scofield" <sja10587@qwest.net> writes:

> I'm not worried about speed per se, rather I'm trying to validate
> my (rough) complexity analysis for the function and, if it works,
> to make some projections for how long it would take to calculate
> various things.

Since you aren't interested in absolute timings, just the algorithmic
complexity, then you could try using a less smart compiler (e.g. nhc98)
which will not automatically optimise away the repeated calls.