This document defines and explains common asymptotic notation used to analyze algorithms, including big-O, big-Theta, and big-Omega notation. It discusses how these notations are used to provide upper and lower bounds on the running time of algorithms as the input size increases. Examples are provided to illustrate the definitions and interpretations of the various notations.