study guides for every class

that actually explain what's on your next test

Time complexity

from class:

AP Computer Science A

Definition

The time complexity of an algorithm refers to the amount of time it takes for the algorithm to run, based on the size of its input. It measures how the runtime increases as the input size increases.

© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.