This document contains lecture notes on asymptotic notation for analyzing algorithms. It defines big O, Ω, and Θ notation for describing the worst-case, best-case, and average-case time complexity of algorithms. It explains that these notations describe the upper and lower bounds of the growth rate of an algorithm's run time as the problem size increases. The document also provides examples of using asymptotic notation to classify common functions and discusses properties like how complexity is affected by addition, subtraction, multiplication, and more.