Merge Sort

Merge Sort is a method for organizing a list of items, like numbers, by repeatedly splitting it into smaller parts, sorting those, and then combining them back together. It works by dividing the list into two halves, sorting each half separately, and then merging the sorted halves into a complete, sorted list. This process continues until all parts are sorted and merged, resulting in an efficiently ordered list. Merge Sort is appreciated for its reliability and consistent performance, especially with large datasets, because it always operates in predictable time regardless of initial order.