The most compact algorithm for Simpson's rule??

[Dieter]

(12-12-2015 08:29 PM)Namir Wrote:  Yes, A ends up as B+h causing the loop to stop iterating.

Since the test if A>B is done *after* the summation this leads to f(B+h) as the last added term – and yields a wrong result. The last term should be f(B–h), resp. f(B) with your method of computing this value twice. As already suggested, all this is better done with a simple loop counter.

Dieter