Sorting Algorithms (bubble sort, merge sort)

What optimization technique is used in this merge function implementation?

function merge(left, right) {
  const result = new Array(left.length + right.length);
  let i = 0, l = 0, r = 0;
  while (l < left.length && r < right.length) {
    result[i++] = (left[l] <= right[r]) ? left[l++] : right[r++];
  }
  while (l < left.length) result[i++] = left[l++];
  while (r < right.length) result[i++] = right[r++];
  return result;
}

Recursive merging
Pre-allocated array
This implementation optimizes merging by: 1) Pre-allocating result array size, 2) Avoiding dynamic array growth, 3) Using direct index assignment instead of push, 4) Reducing memory reallocation overhead, 5) Optimizing array operations, 6) Improving performance for large merges, 7) Minimizing garbage collection impact, 8) Common optimization in performance-critical applications.
Binary search
Hash table lookup

Next Question (14/20)