The answer
If the loop iterates from 0 to N incrementing by 1, the time complexity is strictly O(N) Linear Time.
Time Complexity Analysis of Single Loops
What is the time complexity of a standard for loop?
More FAQs in Time Complexity Analysis of Single Loops
No. Big O measures the worst-case scenario. Even if you break early in the best case, the worst case still requires checking all N elements, so it remains O(N).
O(N) + O(N) = O(2N). However, in Big O notation, we drop constants, so the final time complexity is still O(N).
It halves the number of operations (N/2), but because we drop constants in Big O, it is still considered O(N) linear 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.