<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Document</title>
</head>
<body>
<script>
let arr = [2, 4, 3, 5, 1]
for(let i = 0; i < arr.length - 1; i++){
for(let j = 0; j < arr.length - i - 1; j++){
if(arr[j] > arr[j + 1]){
let temp = arr[j]
arr[j] = arr[j + 1]
arr[j + 1] = temp
}
}
}
console.log(arr)
//sort()可以排序
let Arr =[4, 2, 5, 1, 3]
Arr.sort(function(a, b){
//升序
return a - b
})
console.log(Arr)
Arr.sort(function(a, b){
//降序
return b - a
})
console.log(Arr)
</script>
</body>
</html>
16_冒泡排序
最新推荐文章于 2024-07-18 11:48:33 发布