What’s something new I learned this week?
- formal definitions of O and Ω
- O(n²): set of functions that grow no faster than n²
- Ω(n²): set of functions that grow no slower than n²
- ϴ(n²): set of functions that are in both O(n²) and Ω(n²) (functions growing as fast as n²)
- insertion sort worst-case running time
➔ we first derived the exact form of WIS(n), then determined it’s upper and lower bounds
➔ don’t alway have to derive the exact form, as we will see soon.
What’s something that frustrated and challenged me this week?
I think the most challenge lies on the counting the runtime and worst-case running time, proof part is fine, but the first step is always hard for me, I suppose I need more time to practice.
How does course material relate to other classes or interests?
Maybe the csc148 class, the runtime stuff and the efficiencywe talked about in the class.
How did your tutorial/test/assignment go this week?
I had a little problem in this week's tutorial since there was a problem relating to counting runtime and that's my weakness.