Question: Given the following pseudo code: Algorithm Ex (A, n): Input: An array A storing n 1 integers. Output: The sum of elements at even

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. 5- A[0] for i2 to ni by increments of 2 do ss+A[i] return s Answer the following questions: 2.a [4 pts] What is the memory complexity in Big-O of the algorithm? Answer: 2.b [4 pts] What is the time complexity in Big-O of the algorithm? Answer: 2.c [4 pts] How many times is the statement in the innermost loop executed, as a function of n? Answer: 2.d [4 pts] What are the best and worst case scenarios of order of operations of this algorithm?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
