QuickSort in JavaScript 

<!DOCTYPE html>
<html>
<body>

<script>
function swap(a, l,m)
{
   var t = a[l];
   a[l]= a[m];
   a[m] = t;
}

function qsort(a,left, right)
{
   if (left >= right) return;
   var pid = Math.floor((left+right)/2);
   var temp = a[pid];
   var i = left, j = right;
   while(i<j)
   {
      while(temp<a[j] && i<j) j--;
      while(a[i] <= temp && i < j)i++;
    
      if (i<j)
      {
         swap(a, i, j);  
      }

   }
   swap(a, i, pid);

   qsort(a, left, i-1);
   qsort(a, i+1, right);
}

var a = [2,1,3,4,6,9];
qsort(a, 0, a.length - 1);
document.write(a);
</script>

</body>
</html>

 

posted @ 2017-12-01 16:38  lqj_piaohong  阅读(98)  评论(0)    收藏  举报