Sorting Algorithms (bubble sort, merge sort)

What advanced optimization technique is implemented in this bubble sort variant?

function bubbleSortOptimized(arr) {
  let n = arr.length;
  for(let i = 0; i < n; i++) {
    let lastSwap = 0;
    for(let j = 0; j < n - i - 1; j++) {
      if(arr[j] > arr[j + 1]) {
        [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
        lastSwap = j;
      }
    }
    n = lastSwap + 1;
  }
  return arr;
}

Parallel sorting
Binary search optimization
Last swap tracking
This implements last swap tracking optimization: 1) Tracks position of last swap in each pass, 2) Updates effective array length based on last swap, 3) Skips examining sorted portion after last swap, 4) Reduces number of comparisons significantly, 5) More efficient than standard bubble sort, 6) Adapts to partially sorted arrays, 7) Optimizes subsequent passes based on previous results, 8) Advanced technique for improving bubble sort efficiency.
Quick selection

Next Question (12/20)