Divide & Conquer – Merge Sort Visualization

Problem Statement:

Merge Sort: Recursively divide the array into halves, then merge sorted halves into a final sorted array.

Example: nums = [5, 2, 8, 1, 3]