Here’s a worksheet to briefly discuss asymptotic analysis, considering both comparison of growth rates of functions and analysis of algorithms. We’ll start in on this worksheet soon, and we may move through it very quickly.
Also, here’s a one-pager to review big-O notation, add little-o notation, and offer a way that limits can help you with these comparisons.
Posted in Handouts
We’ll continue the first stable marriage handout and (maybe!) start talking about the critical concept of reductions on our next worksheet.
Important notes for today:
Just a quick note to say that both sections are still working on the introductory SMP worksheet. See you tomorrow!
Posted in Handouts
NOTE: We’re still figuring out whether we’ll separately post handouts and notes for each section or use one combined post. For now, here are handouts and notes similar to those both sections will use tomorrow. (If we split up by section, we’ll find a way for you to disentangle them easily!)
Welcome to CPSC 320!
Our overall course goal is to learn about a common and important set of problem types, algorithmic solution approaches, and analysis techniques, and to gain the tools and experience necessary to judge how a new problem might fit one of these categories, how to approach solving the problem, and how to analyze and adjust your solution.
A few administrative notes for today, much longer than our usual since it’s the start of the term:
Next, here are today’s handouts:
Finally, if you wish to read ahead, we expect to read at least these sections in this order (changes may happen but probably not drastic ones):