Example: tourism industry
Proving Algorithm Correctness - Northeastern University

Proving Algorithm Correctness - Northeastern University

Back to document page

Mathematical induction is a very useful method for proving the correctness of recursive algorithms. 1.Prove base case 2.Assume true for arbitrary value n 3.Prove true for case n+ 1 Proof by Loop Invariant Built o proof by induction. Useful for algorithms that loop. Formally: nd loop invariant, then prove: 1.De ne a Loop Invariant 2.Initialization

  Proving, Correctness

Download Proving Algorithm Correctness - Northeastern University


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries