Question: Consider the following algorithm: Algorithm Sum(A[0..n-1]) //Input: An array A[0..n-1] of n real numbers //Output: ? sum = 0; for i = 0 to n
Consider the following algorithm:
Algorithm Sum(A[0..n-1])
//Input: An array A[0..n-1] of n real numbers
//Output: ?
sum = 0;
for i = 0 to n 1 do
if(A[i] > 0) then
sum = sum + 1;
end if
end for
return sum
a) What does the algorithm compute?
b) What is the range for the number of comparisons (A[i] > 0) performed overall?
c) What is the range for the number of additions (sum + 1) performed overall?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
