Hoo boy, with all the work I've have this month for all my courses, I'm not really sure if I can keep up with all of this before April.
First off, the concept of worst-case scenarios and steps seem to feel a bit obtuse. Although I do understand how "steps" work and the sorting algorithms (somewhat) due to my experience in other CSC courses, I'm not really sure about time complexity under worst-case scenarios. Complexity was something that I didn't get before this course and I'm very sure that I'll be able to understand these concepts better.
On the other hand, I'm trying my best to get proofs so I can finish the assignment. Proof structures are not really a problem anymore, and I'm trying to get how to fill in the missing proofs to complete them.
Finally, there's the inevitable term test. I don't know what's going to be covered on the test, but I'm very sure that it's going to cover proofs and some other concepts that we had learned after Reading Week. After the assignment, I'm going to try to prepare for the test a bit earlier than before by writing down notes. I hope that things will go well, and I can say the same for my other courses which are also filled with work.
Glad to hear proof structures are making sense, and that filling them in is starting to get easier.
ReplyDeleteWorst-case time complexities are all about answering the question "If my input increases in size, how much longer will it take to run this algorithm?". We're rarely interested in exactly how many steps it takes to run the algorithm. We're more interested in whether or not the number of steps depends on the size of the input, and if it does, what that relation is (linearly?, polynomial?, exponentially?).