Arrays — Interactive

Access elements in O(1), insert and delete with shifting, and search linearly. Watch how contiguous memory layout shapes performance.

Access

Index

Insert

Value

Index

Delete

Index

Value

Presets

Speed: Normal

Size

Capacity

—

Last Op Shifts

Try it: Insert at index 0 and watch every element shift right. That's why insertion is O(n)!

Log

Default

Accessing

Shifting

Inserted

Found