Sorting Algorithms (bubble sort, merge sort)

What optimization technique is implemented in this bubble sort algorithm?

function bubbleSort(arr) {
  let swapped;
  do {
    swapped = false;
    for(let i = 0; i < arr.length - 1; i++) {
      if(arr[i] > arr[i + 1]) {
        [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]];
        swapped = true;
      }
    }
  } while(swapped);
  return arr;
}

Early termination when no swaps occur
This optimized bubble sort implementation includes: 1) Early termination using the swapped flag, 2) Stops when no swaps are needed in a pass, 3) Avoids unnecessary iterations on sorted arrays, 4) Best case O(n) for nearly sorted arrays, 5) Uses destructuring for clean swap operation, 6) Do-while loop ensures at least one pass, 7) More efficient than basic bubble sort, 8) Common optimization for improving bubble sort performance.
Skipping sorted elements
Using recursion
Binary search optimization

Next Question (1/20)