A sorting algorithm that divides the unsorted list into n sublists, each containing one element, then repeatedly merges sublists to produce new sorted sublists until there is only one sublist remaining.

"Merge sort is a divide and conquer algorithm that has a best, worst, and average time complexity of O(n log n)."