The merge sort algorithm is a divide-and-conquer sort: split the list in half, sort each half, then merge the two sorted halves. It guarantees O(n log n) time and keeps equal items in order, which is why it sits at the heart of many library sorts. Step through it below, then read how it works….
The quick sort algorithm picks a pivot, moves smaller numbers to its left and larger ones to its right, then sorts each side the same way. It is one of the fastest general-purpose sorts in practice, with an O(n log n) average case. Step through it below, then read how it works and where it…
The bubble sort algorithm is the simplest way to sort a list: walk through it, compare each pair of neighbours, and swap them when they are in the wrong order. Step through it yourself below, then read how it works, what it costs, and when (rarely) you should use it. Try it: click Next to…