In this week's lecture, we learned about the formal definition of big O notation and the worst case analysis of two algorithms. I was absent-minded when Danny talks about counting the steps of insertion sort. The following analysis was based on the counting step. So, I have to have a look of Larry's note for compensation since Danny's handwriting is hard to recognize and I personally think Larry's note is more organized. I have to admit that I am still not used to Danny's teaching method. I found the lecture does not bring me help. I need to spend a lot of time studying on my own. I think Danny really should teach from basic and clarify and point out what is example and what is important concept etc.
The assignment goes pretty good. We spent more than 2 hours last Friday working on it and we came up solutions for all the questions. Then we put the answers together. I believe in my teammates since I am not that really good at this course.
I just realized that the term next is on next Wednesday. That is frustrating. I am not prepared for the test and the time lasts so little. I have a economic quiz due on Wednesday and I have to read through a whole boring and hard-to-understand chapter in order to be able to do the quiz. I don't have enough time. So, I am going to be really efficient this week. I hope I can do well in the second term test.
No comments:
Post a Comment