External Merge Sort

Divide-and-conquer sorting algorithm that splits the data set into separate runs and then sorts them individually.

Phase #1 - Storting

Sort blocks of data that fit in main-memory and then write back the sorted blocks to a file on disk

Phase #2 - Merging

Combine sorted sub-files into a single larger file.