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.
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
29 | 30 | 1 | 2 | 3 | 4 | 5 |
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 | 1 | 2 |