js常用算法自我总结-- 冒泡排序
冒泡排序原理:比较相邻两个数值大小,如果第一个大于第二个交换位置
冒泡属于排序中简单的,相对运行时间来看是较差的一个
// An highlighted block
function bubbleSort(arr) {
var len = arr.length;
for (var i = 0; i < len; i++) {
for (var j = 0; j < len - 1 - i; j++) {
if (arr[j] > arr[j+1]) { //相邻元素两两对比
var temp = arr[j+1]; //保存当前比较小的值
arr[j+1] = arr[j]; //小值位置替换成大值
arr[j] = temp; //大值位置替换成保存的小值
}
}
}
return arr;
}
var arr = [5,41,85,2,54,23,69,21]
console.log(bubbleSort(arr)) //[2, 5, 21, 23, 41, 54, 69, 85]
执行逻辑
开始i循环第一次开始,开始j循环
(1)i = 0 ,i < 8; j = 0,j < 7 ; arr[0] > arr [1]; false=>(2) //[5,41,85,2,54,23,69,21]
(2)i = 0 ,i < 8; j = 1,j < 7 ; arr[1] > arr [2]; false=>(3) //[5,41,85,2,54,23,69,21]
(3)i = 0 ,i < 8; j = 2,j < 7 ; arr[2] > arr [3]; true=> arr[2]=2 arr[3]=85 => (4) //[5,41,2,85,54,23,69,21]
(4)i = 0 ,i < 8; j = 3,j < 7 ; arr[3] > arr [4]; true=> arr[3]=54 arr[4]=85 => (5) //[5,41,2,54,85,23,69,21]
(5)i = 0 ,i < 8; j = 4,j < 7 ; arr[4] > arr [5]; true=>arr[4]=23 arr[5]=85 => (6) //[5,41,2,54,23,85,69,21]
…