//快速排序算法
function quick_sort(ary){
var ary1, ary2, mid, re;
if(ary.length<2){
return(ary);
}
else if(ary.length == 2){
if(ary[0].key > ary[1].key)
return(ary.reverse());
return(ary);
}else{
ary1 = new Array();
ary2 = new Array();
mid = ary[0];
for(var i=1; i<ary.length; i++){
if(ary[i].key < mid.key){
ary1.push(ary[i]);
}else{
ary2.push(ary[i]);
}
}
return(quick_sort(ary1).concat(mid, quick_sort(ary2)));
}
}