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

PhD student Timo Bingmann has created an amazing video showing sorting algorithms in action. And it's surprisingly awesome!

See sort algorithm. Quick Sorting a List This quick sort uses randomly chosen pivots (in red) to keep dividing the list into two until there is only one item on each side of the pivot left.

It then proceeds to sort the copies of that array using std::sort, regular single-threaded quicksort, followed by a number of iterations of sorting with GPU-Quicksort in OpenCL 2.0.

This was the first change to C++’s sorting algorithms in more than a decade and the first update ever to involve an algorithm discovered using AI.