There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Sorting. It’s a classic problem that’s been studied for decades, and it’s a great first step towards “thinking algorithmically.” Over the years, a handful of sorting algorithms have emerged, each ...

If you’re under the impression that something as simple as sorting numbers is dull, think again. This visualization lets you see and hear fifteen different algorithms sift their way through a jumbled ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...