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

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

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

For example, the complexity of sorting N numbers using the bubble sort method is O (N2) and using merge sort method is O (NlogN). This doesn't mean we consume N2 and NlogN processor clock cycles in ...

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.