what is the time complexity of javascript's array .length? I think it would be constant since it seems that property is set automatically on all arrays and you're just looking it up?
相关问题
- Is there a limit to how many levels you can nest i
- How to toggle on Order in ReactJS
- void before promise syntax
- Keeping track of variable instances
- Can php detect if javascript is on or not?
It doesn't seem like a bottleneck but if you want to be sure use
var len = arr.length
and check that. It doesn't hurt and seems to be a tad faster on my machine albeit not a significant difference.Right. Probably. It's a property which is stored (not calculated) and automatically updated as necessary.
Having said that, remember that JavaScript engines are free to do what they like under the covers provided you can't observe any deviation from what the specification says. Since the specification doesn't say anything about the time complexity of
length
...Also remember that JavaScript's standard arrays are, in theory, just objects with special behavior. And in theory, JavaScript objects are property bags. So looking up a property in a property bag could, in theory, depend on how many other properties are there, if the object is implemented as some kind of name->value hashmap (and they used to be, back in the bad old days). Modern engines optimize objects (Chrome's V8 famously creates dynamic classes on the fly and compiles them), but operations on those objects can still change property lookup performance. Adding a property can cause V8 to create a subclass, for instance. Deleting a property (actually using
delete
) can make V8 throw up its hands and fall back into "dictionary mode," which substantially degrades property access on the object.In other words: It may vary, engine to engine, even object to object. But if you use arrays purely as arrays (not storing other non-array properties on them), odds are you'll get constant-time lookup.