javascript实现-冒泡排序算法

javascript实现-冒泡排序算法

function bubblesort(arr) {

var i = arr.length, j;

var tempexchangval;

while (i > 0) {

for (j = 0; j < i - 1; j++) {

if (arr[j] > arr[j + 1]) {

tempexchangval = arr[j];

arr[j] = arr[j + 1];

arr[j + 1] = tempexchangval;

}

}

i–;

}

return arr;

}

var arr = [3, 2, 4, 9, 1, 5, 7, 6, 8];

var arrsorted = bubblesort(arr);

console.log(arrsorted);

alert(arrsorted);