[Javascript Data Structures] 冒泡排序 bubble sort

//冒泡排序
 function bubbleSort(array){
    for (var i = 0; i < array.length; i++) {
        console.log("No."+(i+1));

        for (var j = 0; j < array.length-1; j++) {
             if (array[j]>array[j+1]) {
                 swap(array,j);    
                 //交换             
             }
             console.log(array);
        }
    }
  }
  //交换 
  function swap(array,j){
    var mid;
    mid=array[j];
    array[j]=array[j+1];
    array[j+1]=mid;
  }
// Test
  var array=[4,10,8,2,1];
  bubbleSort(array);

---

Test:

---

第一次循环为例：

---

复杂度

O(N^2)