This New Algorithm for Sorting Books or Files Is Close to Perfection
1 min read
Summary
Last year, a team of seven researchers presented a new algorithm that comes close to identifying the most efficient method for organising data storage.
The “library sorting” problem, which also applies to arranging files on hard drives and in databases, aims to reduce the time it takes to add new items.
While current methods have achieved efficiencies below (log n)2, the team developed a new approach that reduces the time to (log n)1.5.
The algorithm uses a combination of past knowledge and randomness to order items.
The team is continuing to work on the problem and aim to reduce the time further to align with the lower limit of (log n).