Loop Invariant: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
No edit summary
 
(One intermediate revision by the same user not shown)
Line 6: Line 6:
=Overview=
=Overview=


<font color=darkgray>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>
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.