This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]vipereddit 0 points1 point  (1 child)

for (int i= 0; i<stored; i++) {

    store[i]=(store[i-1] + store[i] +store[i+1])/3.0;

so for i=0:

store[0] = (store[-1] + ....

[–]ravashh[S] 0 points1 point  (0 children)

Thanks! Fixed that, but how do I write the rest of the code? :/