Hopefully this will merit my lack of posting.
Today, the Master theorem and its utilization in covering run-time complexity were covered. Its conditions and utilizations in divide-and-conquer recursive algorithms were covered. It helped me in my understanding of time complexity, which was not as strong as I thought it was when I had taken CSC 165.
When looking at the tutorial problems, I kept being unable to prove that the recurrence, T in question 1 was non decreasing with the same parameters as my TA. This was because of a few computational errors, which I fexed immediately.
I'm currently gaining a greater understanding of the course, relative to my understanding at the beginning of the course. I am beginning to apply what I am learning to real world situations, which should be expected (right??)
No comments:
Post a Comment