New algorithm for library sorting problem improves average insertion time from (log n)^2 to (log n) * (log log n)^3, approaching theoretical limit log n. It uses randomness and limited historical data, optimizing organization for faster book placement.
https://www.quantamagazine.org/new-book-sorting-algorithm-almost-reaches-perfection-20250124/