Javascript loop time complexity

Question

When looping an array, people often use a simple method like below.

const array = [1,2,3,4,5];
for (let i = 0; i < array.length; i++) {
    console.log(array[i]);
}

My question is if array[i] is O(1) operation or not.

For example, when i is 3, does javascript get the number immediately OR count from 0 to 3 again?

Time complexity is used for loops and not for operations. So O() will be evaluated for for and not for lookup array[i]. — Rajesh Dixit
– Rajesh Dixit, Commented Nov 8, 2022 at 4:37

Elliott Frisch · Accepted Answer · 2022-11-08 04:30:20Z

2

Yes. array[i] is O(1). However you do it N times, which makes the entire loop O(n).

answered Nov 8, 2022 at 4:30

Elliott Frisch

202k20 gold badges166 silver badges265 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Rajesh Dixit Over a year ago

This could be a comment but oddly answers question as well. Simple and to the point

Amirhossein Sefati · Accepted Answer · 2022-11-08 04:30:48Z

1

Yes, it is O(1).

Because it takes a single step to access an item of an array via its index, or add/remove an item at the end of an array, the complexity for accessing, pushing, or popping a value in an array is O(1).

ref: here

answered Nov 8, 2022 at 4:30

Amirhossein Sefati

7095 silver badges12 bronze badges

Comments

Lee Drum · Accepted Answer · 2022-11-08 04:32:26Z

0

Should be O(1) you can read it at here javascript array complexity

answered Nov 8, 2022 at 4:32

Lee Drum

3491 silver badge8 bronze badges

Collectives™ on Stack Overflow

Javascript loop time complexity

3 Answers 3

1 Comment

Yes, it is O(1).

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

1 Comment

Yes, it is O(1).

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related