Merge Sort

Divide and conquer — watch the array split, sort, and merge back together
Merge Sort: O(n log n) — stable, divide-and-conquer sorting