This week we did more on sorting algorithm analysis and also learned about O, Ω, and ϴ. I really understood the definitions O, Ω, and ϴ and I feel like proving that a function belongs to them is not really that hard, so I really enjoyed that part of the lecture. I found determining the worst-case running time and more specifically the lower bound worst running time to be kind of confusing. For the example of finding the lower bound in class I did not get why each loop was at n/3 iterations. There were 3 loops so I don't know if it came from that or something completely different. I will have to look at more examples and try calculating some on my own to hopefully fully grasp the concept.
I'm pretty confident that I got 2/2 on the tutorial quiz because it was pretty similar to a question for the work we had to do and I did not find that question particularly difficult. I also finished the assignment and although I'm pretty sure I knew whether each claim was true or false, I'm not sure if I did all the proofs correctly. There are only a couple where I am really confident they are completely correct.
No comments:
Post a Comment