Sorting Algorithms (bubble sort, merge sort)

What optimization strategy is demonstrated in this hybrid sorting approach?

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

Pure merge sort
Pure bubble sort
Combined algorithm adaptation
This hybrid approach optimizes sorting by: 1) Using bubble sort for small subarrays, 2) Leveraging merge sort for larger datasets, 3) Combining benefits of both algorithms, 4) Optimizing small-scale sorting operations, 5) Reducing overhead for small arrays, 6) Maintaining merge sort's scalability, 7) Adaptive to different input sizes, 8) Common optimization in practical implementations.
Binary search optimization

Next Question (20/20)