Sorting Algorithms (bubble sort, merge sort)

What algorithmic paradigm does merge sort implement?

function mergeSort(arr) {
  if (arr.length <= 1) return arr;
  const mid = Math.floor(arr.length / 2);
  let left = arr.slice(0, mid);
  let right = arr.slice(mid);
  return merge(mergeSort(left), mergeSort(right));
}

Greedy algorithm
Dynamic programming
Divide and conquer
Merge sort implements divide and conquer by: 1) Dividing array into smaller subarrays, 2) Recursively sorting smaller portions, 3) Combining (conquering) sorted subarrays, 4) Solving complex problem through simpler subproblems, 5) Using recursive division until base case, 6) Merging solutions efficiently, 7) Following systematic problem decomposition, 8) Demonstrating elegant algorithmic design.
Backtracking

Next Question (8/20)