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

Usually, we specify the complexity of an algorithm using the notation O (.), which indicate 'the order of'. For example, the complexity of sorting N numbers using the bubble sort method is O (N2) and ...