**
快速排序
**
let arr = [1,4,3,7,9,5,7,2,10,8];
fn(arr,0,arr.length-1);
function fn(arr,low,height){
if(low>=height){
return;
}
let i = low;
let j = height;
let key = arr[i];
while(i<j){
while(arr[j]>=key&&i<j){
j--;
}
if(i<j){
let t=arr[j];
arr[j]=arr[i];
arr[i]=t;
}
while(arr[i]<=key&&i<j){
i++;
}
if(i<j){
let t=arr[i];
arr[i]=arr[j];
arr[j]=t;
}
// 左边
}
fn(arr,low,i-1);
//右边
fn(arr,i+1,height);
}
**
冒泡排序
**
for(var i=1;i<arr.length;i++){
for(var j=0;j<arr.length-i;j++){
if(arr[j]>arr[j+1]){
var t= arr[j];
arr[j]=arr[j+1];
arr[j+1]=t;
}
}
}