The document summarizes the merge sort algorithm in 3 steps: 1) Divide the array into halves recursively until single elements remain. Sort the left and right halves separately. 2) Merge the sorted halves back together by comparing elements one by one from each half and writing the smaller element into the output array. 3) The overall algorithm runs in O(n log n) time by dividing and conquering the problem in a recursive manner.