Post Reply 
The most compact algorithm for Simpson's rule??
12-12-2015, 05:44 PM
Post: #2
RE: The most compact algorithm for Simpson's rule??
(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.
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
RE: The most compact algorithm for Simpson's rule?? - Thomas Klemm - 12-12-2015 05:44 PM



User(s) browsing this thread: 1 Guest(s)