Now, in CSC165, we are finding algorithm "speeds" for linear and quadratic functions. This is based on the number of "steps" that the algorithm takes in order to properly sort the given list. We are learning to calculate the worst case scenario by giving it an upper bound (big-oh) and a lower bound. Of course, we are using a neat proof outline to clearly show how we get our results.
Besides moving on to these new concepts, we have our second assignment due this week, as well as our second test to write on Wednesday. Both of these assessments unsurprisingly cover proofs with proper notation. We have been doing a lot of practice with proofs, allowing us to gain some more insight as to how to approach various kinds of problems. Doing a past test as a summary and extra practice of what we have learned thus far will be my final preparation for this upcoming test.
No comments:
Post a Comment