Recursive Algorithm Correctness!
Next Milestone After Recurrences arrived was Proving Correctness of Algorithm...
Danny worked Through the Correctness of Binary Search Algorithm in class...
The Pre conditions of Binary Search algorithm were Straight forward, But post conditions were not, Normally Post conditions are supposed to be the desired output from the algorithm But the post conditions of Binary Search made sense on the output but were not obvious to the mind.
By doing examples from course notes The Idea Stick to the mind.
And then we realize that Recursive Algorithm correctness is far more easier,
Danny worked Through the Correctness of Binary Search Algorithm in class...
The Pre conditions of Binary Search algorithm were Straight forward, But post conditions were not, Normally Post conditions are supposed to be the desired output from the algorithm But the post conditions of Binary Search made sense on the output but were not obvious to the mind.
By doing examples from course notes The Idea Stick to the mind.
And then we realize that Recursive Algorithm correctness is far more easier,
Assume the pre conditions Use Induction to prove Correctness leading to post conditions Fairy Simple.
No comments:
Post a Comment