There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

In 2004, a team of researchers found that the best any algorithm could do for the library sorting problem—in other words, the ultimate lower bound—was log n.