Given the following pseudo code: Algorithm Ex (A, n): Input: An array A storing n 1...

 

Transcribed Image Text:

Given the following pseudo code: Algorithm Ex (A, n): Input: An array A storing n 1 integers. Output: The sum of elements at even cells in A. SA [0] for i2 ton - 1 by increments of 2 do SsA[i] return s Answer the following questions: 2.a [5 pts] What is the Big-O order of the operations required by the algorithm? Answer: 2.b [5 pts] How many times is the statement in the innermost loop executed, as a function of n? Answer: Given the following pseudo code: Algorithm Ex (A, n): Input: An array A storing n 1 integers. Output: The sum of elements at even cells in A. SA [0] for i2 ton - 1 by increments of 2 do SsA[i] return s Answer the following questions: 2.a [5 pts] What is the Big-O order of the operations required by the algorithm? Answer: 2.b [5 pts] How many times is the statement in the innermost loop executed, as a function of n? Answer: