arrays #

Shows an array as one contiguous row of memory cells. The animation moves a cursor to A[i] and highlights how the element address is computed as base + i * element_size (constant-time random access), contrasted with a small scanning animation representing O(n) search.

canvasclick to interact

⏮◀◀▶▶STEP0.25x1xZOOM

t=0s

practical uses #

01.Fast random access by index (tables, buffers, images)
02.Storing fixed-size records contiguously for cache-friendly iteration
03.Building blocks for higher-level structures (stacks, heaps, dynamic arrays)

technical notes #

Time-based index cycling (900ms) drives the highlight and cursor interpolation. The address formula is drawn in monospace with a stepped highlight of base/index/size/result. All geometry is scale-responsive and snapped to a coarse grid for a retro blocky aesthetic.

← trees sequences →