函数冒泡排序sort

function sort(arr) {

for (var i = 0; i < arr.length - 1; i++) {

for (var j = 0; j < arr.length - i - 1; j++) {

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

var temp = arr[j]

arr[j] = arr[j + 1]

arr[j + 1] = temp

}

}

}

return arr

}

var arr1 = sort([4, 9, 0, 2, 1, 6])

console.log(arr1);

</script>