The document describes the steps to sort a sequence of numbers using merge sort. It shows how the sequence is recursively split into sub-sequences of length 1, which are already sorted, and then merged back together in the correct order. The sequence 6, 5, 8, 3, 2, 7, 1 is used as an example to demonstrate each step of the merge sort algorithm.