Time Complexities of Basic Operations

It’s very self explanatory of what it should be.

Time Complexity of $\Theta (1)$

• Reading / Writing variables
  • n = 341
  • X = Y
  • X
• Accessing/updating something on heap (even if it has deref):
  • X.age
  • A[42] = 52