It has been a really really busy month.None of the courses i'm taking is a easy course. Each week i had quizzes and assignments due.But it's almost done.Yeah!! One more month to go.
My last post was talking about merge sort.Then we learned divide and conquer and using the Master Theorem which were in the second midterm.
And i think i didn't do well on the midterm. There was only two questions, but every question takes a lot of work to complete. I need to do more practice questions to improve my speed.
Then it's the binary search with the pre-condition,loop invariant and post-condition. Moreover, we learned the proof of correctness of MergeSort(A,b,e) by induction on n=e-b+1 for all arrays of size n and (pre-condiction+execution)->(termination+post-condition).
No comments:
Post a Comment