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

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

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!

An empirical comparison of existing algorithms for the computer generation of exact D-optimal experimental designs is carried out. Among algorithms considered were those due to Wynn, Mitchell, Fedorov ...