In this example, I will implement a variation of the Bubble Sort sorting algorithm, which is one of the easiest sorting algorithms to implement because of its “brute force” nature.

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

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

The longest algorithm it produced was 130 instructions long, for sorting a list of up to five items. At each step, AlphaDev picked from 297 possible assembly instructions (out of many more).