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 ...

On the site you can visualize and compare a whole bunch of algorithms, from common implementations like Quick Sort and Bubble Sort, to more quirky examples like Cocktail Sort and Gnome Sort (really).

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