Merge Sort

overview

How It Works (Divide and Conquer)

1. Divide: Split the array into two halves until subarrays have size 0 or 1.
2. Conquer: Recursively sort each half.
3. Combine: Merge the two sorted halves into one sorted array by repeatedly taking the smaller front element from each half.