There were no lectures or tutorials this week due to the fall break. Therefore I got more time working on Assignment 3. I found that proving big O and big Omega problems not so difficult since the TA went over the big-O problem thoroughly during the tutorial. For proving big-O problems, the first thing to do is to under-estimate the big-O function and over-estimate the function that we are going to prove; then we can easilly pick the number c that satisfy the condition.
However, I was stuck on the 6th question. It seemed that I need to pay attention to the lecture next week.
No comments:
Post a Comment