冒泡排序

<script type ="text/javascript">
//冒泡排序
var arr = [23,294,2323,23,699,43,21,54,88,99,26,87,765,654,999];
//倒序
function sortDesc(arr){
for(var i =0;i<arr.length-1;i++){// i = 0; m =9;  0 - 8 => 9次
for(var j =0; j<arr.length-i-1; j++){ // j = 0 n = 8   0 - 8=> 9次
if(arr[j]<arr[j+1])
{  temp = arr[j]
arr[j]=arr[j+1]
arr[j+1]=temp
}
}

}
document.write(arr);
}
//顺序
function sortAsc(arr){
for(var i =0;i<arr.length-1;i++){// i = 0; m =9; 0 - 8
for(var j =0; j<arr.length-i-1; j++){ // j = 0 n = 9  0 - 8=> 89
if(arr[j]>arr[j+1])
{  temp = arr[j]
arr[j]=arr[j+1]
arr[j+1]=temp
}
}

}
document.write(arr);
}
//调用
sortAsc(arr);
document.write("<br>");
sortDesc(arr);
</script>