冒泡排序

1.js冒泡排序

 1 var arr = [1.7,3,6,9,15,12]
 2 for(var i = 0;i<=arr.length-1;i++){
 3     for(var j = 0;j<=arr.length-i-1;j++){
 4         if(arr[j]>arr[j+1]){
 5         var temp = arr[j]
 6          arr[j] = arr[j+1]
 7          arr[j+1]=temp
 8         }
 9     }
10 }
11 
12 
13 //第二种
14 arr.sort((a,b)=>{
15     return a-b
16 })
17 
18          console.log(arr)

2.函数封装冒泡排序

function arrSort(arr){

for(var i = 0;i<=arr.length-1;i++){

for(var j = 0;j<=arr.length-i-1;j++){

if(arr[j]>arr[j+1]){

var temp = arr[j]

arr[j] = arr[j+1]

arr[j+1] = temp

}

}

}

return arr

}

console.log(arrSort([1,5,3,9,7,15,13,12]))

 

posted @ 2020-07-02 10:46  Toro-zhou  阅读(194)  评论(0)    收藏  举报