O(n) = Linear Time Complexity 📈

The execution time grows directly with the input size.
If the input doubles, the time taken doubles too.

Example: Looping through an array.
For an array of size n, the loop runs n times.

#BigONotation #Algorithms #Coding