Time complexity is a measure of the amount of time an algorithm takes to run, based on the number of elementary operations performed. It is expressed using big O notation and can be worst-case, average-case or best-case. Algorithmic complexities are classified according to the type of function appearing in the big O notation.
Carnegie Mellon University
Spring 2015
A foundational course that introduces formal languages, automata, computability, and complexity theories, including finite automata, Turing machines, and P/NP classes.
No concepts data
+ 35 more conceptsCarnegie Mellon University
Spring 2023
This course provides an initial dive into complexity theory, exploring computations bound by resources like time, space, and energy. Emphasis is placed on low complexity classes.
No concepts data
+ 29 more concepts