Merge Sort is an example of which algorithm design paradigm?

Merge Sort works by recursively dividing the array into two halves until each subarray has one element, then merging them in sorted order. This process follows the divide and conquer paradigm, where a problem is broken into smaller subproblems, solved independently, and then combined to form the final solution.