Give a useful loop invariant for the loop and give a proof that it actually is a loop invariant. You must be able to prove the correctness of the algorithm with this loop invariant to receive credit for this problem. Using the loop invariant from part 1 prove that if sum squared is given an n>0 input it successfully returns the function.
Get Free Quote!
434 Experts Online