New Book-Sorting Algorithm Almost Reaches Perfection
Researchers have created a new algorithm that addresses the library sorting problem: a challenge to devise a strategy for organizing books in some kind of sorted order that minimizes how long it takes to place a new book on the shelf. The problem applies to the arrangement of files on hard drives and in databases. An inefficient system means significant wait times and major computational expense. The new algorithm is very close to the theoretical ideal.