Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Sign In with Facebook Sign In with Google Sign In with OpenID

Categories

We have migrated to a new platform! Please note that you will need to reset your password to log in (your credentials are still in-tact though). Please contact lee@programmersheaven.com if you have questions.
Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

Moving average with varying window size

mnsskmnssk Posts: 1Member
Hello All,

I will be receiving a sequence of numbers a_1,a_2,.....a_n (n ~ million). However, I am given one at a time. Now define

s_t = sum_i(a_i), i = floor(t/2),...,t.

At each round 't', the user inputs a_t, and I output s_t.

This can be easily computed with a space complexity O(n/2), by storing the last $n/2$ entries.

I am wondering if there is a constant space algorithm for this -- that is, I can store some quantities like s_t,s_{t-1},a_t, etc, but it should be a fixed number independent of n.

Please help me with this. I could not think of any, and I suspect it doesn't exist, but I have no proof.

Thank you,
mnssk.
Sign In or Register to comment.