Loop Invariant: Difference between revisions
Jump to navigation
Jump to search
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[ | * [[Algorithms#Loop_Invariant|Algorithms]] | ||
* [[Mathematical Induction]] | * [[Mathematical Induction]] | ||
=Overview= | =Overview= | ||
<font color= | The loop invariant method is a technique that can be used to prove [[Algorithms#Algorithm_Correctness|algorithm correctness]]. | ||
<font color=darkkhaki>TODO, [https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844/ref=sr_1_2?ie=UTF8&qid=1533440533&sr=8-2 CLRS] pages 18 - 20.</font> | |||
Latest revision as of 18:48, 9 November 2021
Internal
Overview
The loop invariant method is a technique that can be used to prove algorithm correctness.
TODO, CLRS pages 18 - 20.