js冒泡排序
<script>
var arr = [8, 10, 3, 5, 6, 1, 7];
function sort(arr) {
for (i = 0; i < arr.length - 1; i++) {
for (j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
var change = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = change;
}
}
}
}
console.log(arr);
sort(arr);
console.log(arr);
</script>