The most compact algorithm for Simpson's rule??

[Namir]

This is a slightly different version based on one of Dieter's remarks.

Code:

h=(B-A)/N
Sum=f(A)-f(B)
k=4
A=A+h
Do
  Sum = Sum + k*f(A)
  k=6-k
  A=A+h
  N=N-1
Loop Until N=0
Area=h/3*Sum