This visualization demonstrates how a simple recursive algorithm, Head/Tails Breaks, partitions a skewed data distribution into distinct class breaks. The code first calculates the mean of the full dataset, filters out all values below that mean, and repeats the process on the remaining higher values until no data points remain. The resulting break values are then plotted as horizontal lines over a strip of points, using D3’s force simulation to jitter the points for visibility. The data comes from a small inline array, and the rendering relies on D3’s scale and axis functions to map the sorted values to positions, making the unequal spacing of breaks immediately apparent.