Time/Space complexity of PHP Array

Question

Is there a way or a resource for finding the time and space complexity of the Array implementation in PHP other than calculating it by hand?

An array

Answer 1

Accessing and iterating is describe by @Mike-Lewis so far

• Setting a value: O(1)
• Append: O(1) (Its the same as setting a value to the key "length")
• Prepend: O(n) (Its a guess, but should fit, because it should rewrite the existing keys)
• Unset: O(1)

Anything missed?