冒泡排序，快速排序，插入排序（JS版）

//冒泡排序<br />function sortBubble(array){<br /> var len=array.length,i,j,tmp;<br /> for(i=len-1;i>=1;i--){<br /> for(j=0;j<=i-1;j++){<br /> if(array[j]>array[j+1]){<br /> d=array[j+1];<br /> array[j+1]=array[j];<br /> array[j]=d;<br /> }<br />}<br /> }<br /> return array;<br />}<br />//快速排序<br />function sortQuick(array){<br /> var low=0,high=array.length-1;<br /> var sort=function(low,high){<br /> if(low==high){<br /> return;<br />}<br />var key=array[low];<br />var tmplow=low;<br />var tmphigh=high;<br />while(low<high){<br /> while(low<high&&key<=array[high]){<br /> --high;<br /> }<br /> array[low]=array[high];<br /> while(low<high&&array[low]<=key)<br /> {<br /> ++low;<br /> }<br /> array[high]=array[low];<br /> if(low==tmplow){<br /> sort(++low,tmphigh);<br />return;<br /> }<br />};<br />array[low]=key;<br />sort(tmplow,low-1);<br />sort(high+1,tmphigh);<br /> };<br /> sort(low,high);<br /> sort();<br /> return array;<br />}<br />//插入排序<br />function sortInsert(array){<br /> var i=1,j,len=array.length,key;<br /> for(;i<len;i++){<br /> j=i;<br /> key=array[j];<br />while(--j>-1){<br /> if(array[j]>key){<br /> array[j+1]=array[j];<br /> }<br /> else<br /> {<br /> break;<br /> }<br />}<br />array[j+1]=key;<br /> }<br /> return array;<br />}