The video starts by describing two common sorting algorithms; “ bubble sort ” and “ insertion sort.” In the former, a sorting algorithm repeatedly steps through a list that needs to be ...

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

In fact, “ 15 Sorting Algorithms in 6 Minutes ” — created by Timo Bingmann, a PhD student at the Karlsruhe Institute of Technology — is one of the most weirdly hypnotic viewing experiences ...

The sort may alternate from the top of the list to the bottom and then from the bottom to the top. The name comes from the notion that items are raised or "bubbled up" to the top. See sort algorithm.