游客

标题:javascript实现的常用算法（如冒泡、快速、归并、鸽巢、奇偶等）
正文:
代码如下:
l = [6, 2, 4, 1, 98, 34, 5, 9, 23, 8, 10, 32]


//冒泡排序
/*function bubbleSort(arr) {
newarr = arr.slice()
if (newarr.length <= 2) return newarr
for (var i = 0; i < newarr.length - 1; i++) {
for (var j = 0; j < newarr.length - i - 1; j++) {
if (newarr[j] > newarr[j + 1]) {
newarr[j] = [newarr[j + 1], newarr[j + 1] = newarr[j]][0]

}
}
}
return newarr
}

console.log(l)
result = bubbleSort(l)
console.
[<<][[1]][2][3][>>]

查看评论(0)
发表评论



首页