An array (or ArrayList/dynamic array) stores elements next to each other in memory, so random access is O(1). Inserts/deletes in the middle are O(n) because elements must shift (and resizing may copy). A LinkedList stores nodes linked by pointers: inserts/deletes at a known node are O(1), but random access is O(n) and it uses extra memory.