Exercises 6–9 each contain a while loop annotated with a
Chapter 5, Problem 8E(choose chapter or problem)
Problem 8E
Exercises 6–9 each contain a while loop annotated with a preand a post-condition and also a loop invariant. In each case, use the loop invariant theorem to prove the correctness of the loop with respect to the pre- and post-conditions.
[Pre-condition: sum = A[1] and i = 1]
while ( i ≠ m)
1. i := i + 1
2. sum: = sum + A[i ]
end while
[Post-condition: sum = A[1] + A[2]+· · ·+ A[m]] loop invariant: I (n) is “i = n +1 and sum = A[1] + A[2]+· · ·+ A[n + 1].”
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer