冒泡排序法:
<html> <head>
<meta http-equiv="content-type" content="text/html;charset=utf-8"/>
<script type="text/javascript">
var arr=[0,-1,90,-18,900,90,78];
var temp=0;
for(var i=0;i<arr.length-1;i++) {
//定小循环
for(var j=0;j<arr.length-1-i;j++)
{
if(arr[j]>arr[j+1])
{ //交换
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp; }
}
}
//输出数组
document.write(arr);
</script> </html>