Bubble Sort in Javascript

bubbleSort.js

// Normal
const bubbleSort = function(array) {
  let swaps;
  do {
    swaps = false;
    for (let i = 0; i < array.length - 1; i++) {
      if (array[i] > array[i + 1]) {
        let temp = array[i + 1];
        array[i + 1] = array[i];
        array[i] = temp;
        swaps = true;
      }
    }
  } while (swaps);
  
  return array;
};

// Recursively
const bubbleSort = function (array, pointer = array.length - 1) {
  // Base Case
  if (pointer === 0) {
    return array;
  }

  for (let i = 0; i < pointer; i++) {
    if (array[i] > array[i + 1]) {
      let temp = array[i + 1];
      array[i + 1] = array[i];
      array[i] = temp;
    }
  }   
  // Recursive call on smaller portion of the array
  return bubbleSort(array, pointer - 1);  
};

cool

关键在于相互交换数组中元素的位置。

The key is to swap the positions of the elements in the array.

const bubblesortOnce = a => {
  for(let i=0; i<a.length; i++)
    if(a[i] > a[i+1])
      [a[i], a[i+1]] = [a[i+1], a[i]] // [ 4, 5 ] --> [ 3, 5 ] --> [ 2, 5 ] --> [ 1, 5 ]
  return a
}

@nick3499 your code doesn't work correctly.

bubblesortOnce([99,25,1,109,3,1009,243,345])

gives output:
(8) [25, 1, 99, 3, 109, 243, 345, 1009]

@luckyguy73 try this

function bubbleSort(list){
  let swapped=false;
    list.forEach((item,index)=>{
    if(item>list[index+1]){
      [list[index],list[index+1]] = [list[index+1],list[index]];
      swapped=true;
    }
  });
  if(swapped){
    return bubbleSort(list);
  }
  return list;
}