Merge Sort Algorithm

It's a divide-and-conquer sorting algorithm that divides the array into two halves, sorts each half, and then merges the two sorted halves into a single sorted array.