Time complexity is a fundamental concept in computer science that describes the amount of time an algorithm takes to run as a function of the input size. Understanding time complexity helps you write more efficient code and choose the right algorithm for your specific use case.

Big O Notation

Big O notation is the standard way to express time complexity. It describes the upper bound of an algorithm's running time, focusing on how the runtime grows as the input size increases. Common time complexities include:

• O(1) - Constant time: The algorithm takes the same amount of time regardless of input size
• O(log n) - Logarithmic time: The running time increases logarithmically with input size
• O(n) - Linear time: The running time increases linearly with input size
• O(n log n) - Linearithmic time: Common in efficient sorting algorithms
• O(n²) - Quadratic time: Often seen in nested loops

The goal is not always to find the fastest algorithm, but to find the one that best balances performance with code clarity and maintainability.

Practical Examples

Let's look at some practical examples. When you access an element in an array by index, that's O(1). When you search through an unsorted array, that's O(n). When you use a hash map for lookup, that's typically O(1) on average.