<script> function quiktSort(arr){ var left =[],right=[];if(arr.length<1){return arr;} var index = Math.floor(arr.length/2); var point = arr.splice(index,1); for(var i=0,len=arr.length;i<len;i++){ if(arr[i]<point) { left.push(arr[i]); } else{ right.push(arr[i]); } } return quickSort(left).concat(point,quickSort(right));}</script>
