冒泡排序法

<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>冒泡排序法</title>
</head>
<body>
<script>
var arr1 = [3,2,4,5,1,0,44,2,1];
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;
}
console.log(bubbleSort(arr1));
</script>
</body>
</html>

原文地址:https://www.cnblogs.com/studyh5/p/9771378.html