Lecture 01: Introduction, Asymptotics, and Peak Finding

Content locked

The catalog is public. Reading this content requires approved access.

Course expectations

What is an algorithm?

Measuring efficiency: finding a maximum

Asymptotic notation

Leading terms and a worked proof

Rules and pitfalls

Why growth rates matter

Model of computation

Peak finding

Uphill-window lemma

Divide-and-conquer algorithm

Recurrences and further practice

Reading