
Lecture 6: Asymptotics
Zachary Abel continues MIT's 6.1200J Mathematics for Computer Science with a session on asymptotic analysis. He opens by applying the summation and approximation techniques from the previous week to a classic physics problem, using it as a concrete warmup before turning to the formal machinery. The bulk of the lecture works through asymptotic notation: Big-O, Little-o, Big-Omega, and Little-omega, explaining how each bounds the growth of functions and how they relate to one another. Abel builds the definitions on the board step by step, connecting them back to the summation estimates covered earlier in the course so students see why these tools matter for analyzing algorithms. The lecture runs seventy-eight minutes as part of MIT OpenCourseWare's Spring 2024 offering of 6.1200J, a core discrete mathematics course for computer science students.