About this document

CS502 Algorithm Fundamentals Handouts by Payal Sharma is a document available to read on EtoBox.

The document defines asymptotic notation and common asymptotic running times. It formally defines big O, Ω, and Θ notation to describe upper bounds, lower bounds, and both bounds of functions. Examples show how to use limits to prove functions are asymptotically equivalent. Common asymptotic running times include constant, log n, n, n log n, polynomials, exponentials, and factorials.

Author

Payal Sharma

Language

EN