 This algorithm has demonstrated better performance on machines that benefit from cache optimization.Also, many applications of external sorting use a form of merge sorting where the input get split up to a higher number of sublists, ideally to a number for which merging them still makes the currently processed set of pages fit into main memory.Merge sort parallelizes well due to the use of the divide-and-conquer method.