I'm trying to find the moving average for an array of integers.?

Question

Is there an efficient way to do this?

Answer 1

There is an efficient way to do this. Assume you want a moving window of size M, sum up the first M numbers in that array and store this in a temporary variable. Next subbract out the first element and add in the M+1 th element. This is the running sum for the set of numbers from 2 to M+1. This is more efficient than trying to rerun the sum all over again.