Re: [Haskell-beginners] Simple Moving Average of a list of real numbers

On Wed, Nov 27, 2013 at 12:11 AM, Michael Orlitzky wrote:

Inline below is some code that uses this idea along with a "scan" (similar to a fold) to accomplish the moving average.

Hi Michael, When I read OP's request, I understood it as what Ozgur had interpreted, i.e. last N items for a /constant/ N, also known as a moving window average. Your running average solution is interesting too! -- Kim-Ee