Lecture 8

Asymptotic Analysis (Part I)

Learning Outcomes

At the end of this lecture, you’ll be able to:

Lecture Plan

In this lecture, we'll cover the following lessons:

  1. Efficiency: A pragmatic definition
  2. RAM: A Hypothetical Computer!
  3. RAM: Algorithm Run Time
  4. RAM: Counting Steps
  5. Running Time: Size of The Input
  6. Running Time: Choosing the Input
  7. Running Time: Best vs Worst Case
  8. Running Time: Average Case
  9. Running Time: Exercise
  10. Running Time: Exercise
  11. Running Time: It's hard to count precisely!

Lessons marked with ⚡ contain exercise/activity.