Question

Let A[n] be an array of n numbers. Design algorithms to perform the following operations:

Add (i, y): Add the value y to the i^th number in the array Partial-sum(i) : returns the sum of the first i numbers in the array

Answer 1

Operation 1

add (i ,y)

{

A[i] = A[i] + y;

}

Operation 2

partialsum (i, y)

{

int sum=0;

for ( ; i > 0 ; i--) 

sum = sum + A[i];

return sum; 

}