javascript 二分查找排序

var numbers = [1,23,13,24,15,16,9,2,33];

function fastSort(arr)

{

var arrTemp = [arr[0]];

var left = 0;

var right = arrTemp.length;

var mid = 0;

console.log("排序前："+arr);

for(var i = 1;i<arr.length;i++)

{

left = 0;

right = arrTemp.length;

while(left != right)

{

mid = Math.floor((left + right)/2);

if(arrTemp[mid] < arr[i])

{

left = mid + 1;

}

else

{

right = mid;

}

if(left == right)

{

//console.log(left + ".." + right);

arrTemp.splice(right,0,arr[i]);

break;

}

}

}

console.log(arrTemp);

}

fastSort(numbers);

发现个不错的网站，直接可以在上面写代码测试哈哈。http://c.runoob.com/compile/22