📏 Sorting Cost Meter: Comparisons, Moves and the log2(n!) Information Bound for Eight Algorithms

Watch eight sorting algorithms rearrange 3D bars on a ruled plinth while a meter counts every comparison and array write. Race all eight on the same input, sweep the input size to measure how cost scales, and compare with the n log n and n(n-1)/2 formulas and the information-theoretic minimum log2(n!).