Example: biology
Proving Algorithm Correctness

Proving Algorithm Correctness

Back to document page

proof by cases/enumeration proof by chain of i s proof by contradiction proof by contrapositive For any algorithm, we must prove that it always returns the desired output for all legal instances of the problem. For sorting, this means even if the input is already sorted or it contains repeated elements. Proof by Counterexample

  Proof, Proving, Correctness

Download Proving Algorithm Correctness


Information

Domain:

Source:

Link to this page:

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

Other abuse

Advertisement

Related search queries