Establishing Correctness of Algorithms

Test data: normal, boundary, erroneous
Precondition: what must be true before (n ≥ 0)
Postcondition: what is true after (s = sum of squares)
Loop invariant: stays true each time round the loop

Show an algorithm is correct with dry runs (trace tables), test data and pre/post-conditions.

📘 Learn it

Short cards. Read them, then check your understanding below.

Answer each activity and press Check. Wrong answers turn red. Press Show me if you are stuck.

Revise this chapter in the AsghinLabs Academy workbooks.