js排序算法--冒泡排序
<!DOCTYPE html> <html> <head> <title></title> </head> <body> <script type="text/javascript"> 1.冒泡排序 this.bubbleSort=function(){ var length=array.length; for(var i=0;i<length;i++){ for(var j=0;j<length-1;j++){ if(array[j]>array[j+1]){ var swap=array[j]; array[j]=array[j+1]; array[j+1]=swap; } } } } 2.改进后的冒泡排序: this.bubbleSort=function(){ var length=array.length; for(var i=0;i<length;i++){ for(var j=0;j<length-1-i;j++){ if(array[j]>array[j+1]){ swap(array[j],array[j+1]); } } } } </script> </body> </html>