My implementation of Bubble sort

bubbleSort.js

function bubbleSort(array) {
  for (let i=1, sorted; !sorted; i++) {
    sorted = 1;

    for (let j=0; j < array.length - i; j++) {
      if (array[j] > array[j+1]) {
        [array[j+1], array[j], sorted] = [array[j], array[j+1], 0];
      }
    }
  }
}

Just for academic purposes.

Using the nifty Javascript Destructuring assignment!

Before someone, inadvertently points out, this is an already "optimized bubble sort" algorithm. The i variable of the first for, starts with value 1 to prevent that already ordered items be evaluated again through this section j < array.length - i, in the second for.

I believe this is the best implementation of Bubble sort so far. You can disagree though.