O(n) - Linear Time

Easy

O(n) - Linear Time

Learn O(n) with array sum. Honestly visit all elements once!

ComplexityLinear SearchArray

O(n) is "Linear Time", where time grows proportionally with data size N.

1/13

Find the sum of array [10, 20, 30, 40, 50]! How many operations needed?

Basics

O(n) is "Linear Time", where time grows proportionally with data size N.

Best

O(n)

Average

O(n)

Worst

O(n)

Space Complexity

O(1)

O(n) - Linear Time | AlgoNote