Welcome to Week 3 of Analysis of Algorithms. The lecture for this week
introduces classical approximation methods, which are one key to
understanding our ability to derive concise and precise descriptions of
seemingly-complicated functions that arise in the analysis of algorithms.
----------
Lecture 4: Asymptotics. Exact answers are often cumbersome, so we next
consider a scientific approach to developing approximate answers that,
again, mathematicians and scientists have used for centuries.
----------
Your assignment for this week, due at 11:59PM on
Thursday, February 21, 2019
is to write up and submit solutions to
Exercises 4.9, 4.23, 4.38, and 4.71
in "Analysis of Algorithms" (second edition). Please note the error
in 4.71 (discovered by students last time we offered this
course). You can find the corrected (and simplified) version on the booksite.
Also, as will be discussed in class meeting on Monday, you need to submit
as potential exam question on the week's material as a part of
each assignment from now on.
Email files named “-PS3-Q1.pdf",
“-PS3-Q2.pdf", “-PS3-Q3.pdf",
“-PS2-Q4.pdf", and “-PS2-QQ.pdf"
directly to me at rs@cs.princeton.edu.
RS