Sorting Algorithms (bubble sort, merge sort)

What key feature of merge sort is demonstrated by this merge function?

function merge(left, right) {
  const result = [];
  let leftIndex = 0, rightIndex = 0;
  
  while (leftIndex < left.length && rightIndex < right.length) {
    if (left[leftIndex] <= right[rightIndex]) {
      result.push(left[leftIndex++]);
    } else {
      result.push(right[rightIndex++]);
    }
  }
  
  return result.concat(left.slice(leftIndex), right.slice(rightIndex));
}

In-place sorting
Stable sorting
This merge function demonstrates stable sorting because: 1) Maintains relative order of equal elements, 2) Uses <= comparison to preserve order, 3) Processes elements sequentially, 4) Concatenates remaining elements in order, 5) Essential for maintaining data relationships, 6) Important for sorting objects with multiple properties, 7) Guarantees predictable sorting results, 8) Critical feature for many real-world applications.
Quick merging
Binary splitting

Next Question (4/20)