冒泡排序
function bubbleIngSort(arr){
var len = arr.length;
for(var i = 0; i < len; i++){
for(var j = 0;j < len - i -1; j++){
if(arr[j]>arr[j+1]){
var exchanges= arr[j];
arr[j] = arr[j+1];
arr[j+1] = exchanges;
}
}
}
return arr;
}