The answer
Yes, because Big O classifies the algorithm based on its worst-case potential, which would be searching the entire array without finding the item until the end.
Understanding O(N) Linear Time Complexity
If I find the item on the first try, is it still O(N)?
More FAQs in Understanding O(N) Linear Time Complexity
It means the runtime of the algorithm grows directly and proportionally with the size of the input data.
Almost always, assuming it iterates from 0 to N. If the loop increments by multiplying (i *= 2), it is logarithmic, not linear.
Methods like 'indexOf' or 'includes' cannot magically find data; they run a hidden for-loop through the array to check each element, which takes O(N) time.
Still have questions?
Browse all our FAQs or reach out to our support team
Want to upskill yourself?
Your learning library
Small steps. Big possibilities.
Find your next course. Build something great.