Sorting Algorithms (bubble sort, merge sort)

What is the significance of the base case condition (arr.length <= 1) in this merge sort implementation?

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

It improves sorting speed
It prevents stack overflow
It handles empty arrays
It terminates recursion for single elements
The base case is crucial because: 1) Terminates recursive calls for arrays of length 0 or 1, 2) Single elements are inherently sorted, 3) Prevents infinite recursion, 4) Forms the foundation of divide-and-conquer strategy, 5) Ensures algorithm works with any array size, 6) Optimizes processing of small subarrays, 7) Essential for recursive algorithm correctness, 8) Common pattern in recursive sorting algorithms.

Next Question (3/20)