Definition:
Time complexity measures how the running time of an algorithm increases as the size of the input grows.
Example:
If an algorithm examines every element in a list of size n, , its time complexity is O(n). If it uses nested loops through the list, its time complexity is O(n²).
Summary: Time complexity describes how the execution time of an algorithm grows with input size.