1.普通的冒泡排序:
function sort(arr)
{
var length =arr.length;
for(let i=0;i<length;i++)
{
for(let j = i;j<length;j++)
{
if(arr[i]>arr[i+1])//相邻比较
{
var temp = arr[i+1];//交换
arr[i+1] = arr[i];
arr[i] = temp;
}
}
}
return arr;
}
var a = [3,1,2,4];
console.log(sort(a));
2.改进版的冒泡排序:(通过记录交换的位置)
function sort(arr){
var i = arr.length;
while(i>0){
var pos = 0;//每次开始都是无交换
for(let j=0;j<i;j++)
{
if(arr[j]>arr[j+1])
{
pos =j;
var temp = arr[j+1];
arr[j+1] = arr[j];
arr[j] = temp;
}
}
i = pos;
}
return arr;
}
var a = [3,1,4,6,8]
console.log(sort(a));
3.改进版的冒泡排序(两边收敛)
function sort(arr)
{
var low =0;
var high =arr.length-1;
while(low<high)
{
for(let j=low;j<high;j++)
{
if(arr[j]>arr[j+1])
{
var temp = arr[j+1];
arr[j+1] = arr[j];
arr[j] = temp;
}
}
--high;
for(let i = high;i>low;i--)
{
if(arr[i]<arr[i-1])
{
var temp = arr[i];
arr[i] = arr[i-1];
arr[i-1]= temp;
}
}
++low;
}
return arr;
}
var a= [3,1,6,8];
console.log(sort(a));