Sorting Algorithm Race

Four sorting algorithms race on identical data. Bubble sort and insertion sort compare neighbours one at a time—painfully slow on large arrays. Merge sort and quicksort divide and conquer, finishing in a fraction of the steps. The difference between O(n²) and O(n log n) is not abstract here: you can see it happen.