Operation | Dynamic Array (List) | Static Array (NumPy) | Circular Array |
---|---|---|---|
Access (index) | O(1) | O(1) | O(1) |
Append | O(1)* | N/A | O(1) |
Insert (beginning) | O(n) | N/A | N/A |
Insert (middle) | O(n) | N/A | N/A |
Delete (beginning) | O(n) | N/A | O(1)** |
Delete (middle) | O(n) | N/A | N/A |
Search (unsorted) | O(n) | O(n) | O(n) |
Search (sorted) | O(log n)*** | O(log n)*** | O(n) |
Implementation | Space Complexity | Additional Notes |
---|---|---|
Dynamic Array (List) | O(n) | Typically allocates 2x needed space |
Static Array (NumPy) | O(n) | Fixed size, more memory efficient |
Circular Array | O(n) | Fixed size with constant extra space |
Multi-dimensional | O(n*m) | For 2D array with n rows and m columns |