Question: Let A[1..n] be an array with n elements. Consider the Prefix-Average algorithm, with the pseudocode below 1, 8 = 0 2. let B[1...n] be a
![Let A[1..n] be an array with n elements. Consider the Prefix-Average](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f0072e5e5a4_50966f0072dccdc5.jpg)
Let A[1..n] be an array with n elements. Consider the Prefix-Average algorithm, with the pseudocode below 1, 8 = 0 2. let B[1...n] be a new array 3, for j = 1 to n 5. print s Which of the following is the correct loop invariant for the for loop? O At the start of each iteration j of the for loop, s represents the average of the elements in the prefix subarray A[1.j+1 O At the start of each iteration j of the for loop, s represents the average of the elements in the prefix subarray Al1.j1. O At the start of each iteration j of the for loop, s represents the average of the elements in the prefix subarray AlO.j]. O At the start of each iteration j of the for loop, s represents the average of the elements in the prefix subarray A[1.j-1]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
