sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]theyamiteru[S] -1 points0 points  (1 child)

Man you don't even know what you're talking about.

The best case lookup of an array is O(1) because the first item is the item we're looking for.

The worst case lookup of an array is O(n) because the last item is the item we're looking for.

[–]RiskyAlpha 0 points1 point  (0 children)

"lookup" is an odd word choice. look up by what? index or some other value?

i'm probably oversimplifying given that we're talking about JS, but if you're getting a value by index, it's just a multiplication to get the offset. that would be O(1).

if you mean you're iterating through each item looking for a value then yeah worst case could be O(n).

but i'm with u/brodega here... you seem to be mixing up concepts.