What are some examples of time complexity in algorithms?

What are some examples of time complexity in algorithms?

Time complexity measures how the runtime of an algorithm increases with the size of the input. Common examples include O(1), O(n), O(n^2), and O(log n).

Can you explain what O(n^2) means?

O(n^2) indicates that the time taken by the algorithm grows quadratically as the input size increases. For example, a nested loop iterating over the same data set.

What about O(log n)? How does that work?

O(log n) means that the time complexity increases logarithmically, which is much slower than linear growth. A classic example is binary search.

Are there any algorithms that run in constant time?

Yes, algorithms that run in constant time, O(1), take the same amount of time regardless of the input size. An example is accessing an element in an array by index.