Sorting Algorithms (bubble sort, merge sort)

What variation of merge sort does this code implement?

function mergeSortInPlace(arr, start = 0, end = arr.length - 1) {
  if (end - start <= 0) return;
  const mid = Math.floor((start + end) / 2);
  mergeSortInPlace(arr, start, mid);
  mergeSortInPlace(arr, mid + 1, end);
  mergeInPlace(arr, start, mid, end);
}

Standard merge sort
In-place merge sort
This implements in-place merge sort: 1) Attempts to minimize auxiliary space, 2) Uses array indices instead of slicing, 3) Modifies array directly, 4) Reduces memory overhead, 5) More complex implementation than standard version, 6) Trades space efficiency for time, 7) Useful in memory-constrained environments, 8) Advanced variation of classic merge sort.
Iterative merge sort
Hybrid merge sort

Next Question (18/20)