写一段js的冒牌排序算法

function bubbleSort(arr) { var len = arr.length; for (var i = 0; i < len - 1; i++) { for (var j = 0; j < len - 1 - i; j++) { if (arr[j] > arr[j + 1]) { var temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } return arr; }

//测试 var arr = [3, 5, 1, 9, 8, 6]; console.log(bubbleSort(arr)); //[1, 3, 5, 6, 8, 9]