algorithmic complexity theory
nounUK /ˌælɡəˈrɪðmɪk kəmˈpleksəti ˈθɪəri/
US /ˌælɡəˈrɪðmɪk kəmˈpleksəti ˈθiːəri/
The study of how much time and space a computer needs to solve a problem.
In algorithmic complexity theory, we compare how fast different sorting methods run as the list gets bigger.
SYNONYMS
OTHER MEANINGS
2. A branch of computer science that sorts problems into easy and hard classes.
Algorithmic complexity theory puts sorting in an easy class and some puzzle problems in a hard class.
3. The math used to estimate how a program's running time grows with input size.
Using algorithmic complexity theory, she predicted the program would slow down quickly for large inputs.
4. A way to compare algorithms by their worst-case cost rather than by testing them on one computer.
Thanks to algorithmic complexity theory, the team chose the faster method before writing any code.