The most compact algorithm for Simpson's rule??

[Namir]

(12-12-2015 05:44 PM)Thomas Klemm Wrote:  

(12-12-2015 04:24 PM)Namir Wrote:  

Code:

Loop Until B<A

This should be something like \(A\approx B\) or else you may end up with \(A=B+h\).
I'd probably use \(N\) instead to control the loop.

Yes, A ends up as B+h causing the loop to stop iterating.