#Divide-and-Conquer

Merge Sort

The page explains merge sort as a divide-and-conquer method that splits an array into smaller subarrays until size 0 or 1, then rebuilds a sorted array by merging.