C++ compile and execution times

[Mike Stump]

Please see my previous email on the topic.  
http://gcc.gnu.org/ml/gcc/2002-08/msg00717.html  Net result, 0.03% 
speedup.  Not worth it, in general.  Feel free to update the patches 
and try it on your benchmark.  Maybe you can find code that shows a 
much better improvement.

On Thursday, November 21, 2002, at 05:37 PM, Roger Sayle wrote:
> The problem I've noticed is that the recursion in "fold" appears
> to be O(n^2) instead of O(n).

I don't believe it is.  Try it out.  I think one the first ply is 
folded, thus limiting the amount of work done.