Please help with this question?

Given a set A = {a1, a2, ... an} of n integers, describe, in pseudo-code, an efficient method for computing each partial sums sk = sum i=1 to k: ai, for k = 1, 2, ... n. What is the running time of this method?