By now i'm pretty familiar with recursion and this was another recursion filled recursion. With binary search (ahh yes it brings back memories). But WAIT! we didn't use the basic induction structure to prove anything... we basically had to use the pre-condition to prove the post condition. Well actually we had to prove that the recursive statement terminates... that is reaches the base case and finally returns something. This kind of took long...even while i was practicing it took atleast 2 pages to do. But it was infact easiar than certain proofs that i have done.
PROBLEM SET 4 AND A2!! i'm doomed... :P
No comments:
Post a Comment