冒泡排序的个人理解:
<!-- 冒泡排序 -->
<script>
var arr = [9, 8, 7, 6, 5, 4, 3, 2, 1]//定义一个数组
for (let j = 0; j < arr.length - 1/* 倒数第二论比较剩下最小值后,不必再进行下一次比较 */; j++) {
for (let i = 0; i < arr.length - 1 - j/* 一轮循环后组内最大值已在数组最后确定,不必再次比较 */; i++) {
if (arr[i] > arr[i + 1]) {
var temp = arr[i] //定义一个临时变量存储要替换的值
arr[i] = arr[i + 1]
arr[i + 1] = temp
}
}console.log(arr)
}
</script>
下列有一组成绩,请按照他们的成绩从小到大对这些学员进行排序。
<script>
// 下列有一组成绩,请按照他们的成绩从小到大对这些学员进行排序。
var data = [{ name: "张三", score: 98 }, { name: "李四", score: 78 }, { name: "王五", score: 34 }, { name: "马六", score: 81 }, { name: "大头", score: 18 }, { name: "大雄", score: 8 }, { name: "小夫", score: 88 }, { name: "柯南", score: 100 }, { name: "小福贵", score: 68 }]
for (let j = 0; j < data.length - 1; j++) {
for (let i = 0; i < data.length - 1 - j; i++) {
if (data[i].score > data[i + 1].score) {
var temp = data[i]
data[i] = data[i + 1]
data[i + 1] = temp
}
}
} console.log(data)
</script>
标签:arr,name,冒泡排序,length,score,var,data
From: https://www.cnblogs.com/zerotwo-zrx/p/17331127.html