希尔排序

    function shellSort(array) {
          var j, i, v, h=1, s=3, k,n = array.length
          while(h < n)
            h=s*h+1;
        
          while(h > 1) {
            h=(h-1)/s;
            for (k=0; k<h; k++)
              for (i=k+h,j=i; i<n; i+=h, j=i) {
                v=array[i];
                while(true)
                  if ((j-=h) >= 0 && array[j] > v)
                    array[j+h]=array[j];
                else
                  break;
                array[j+h]=v;
              }
          }
        }

<!doctype html>
<html dir="ltr" lang="zh-CN">
  <head>
    <meta charset="utf-8"/>
    <title>希尔排序 by 司徒正美</title>

var randArray = [];
        for(i=0; i<100; i++)
          randArray[i]=Math.floor((Math.random())*10000);

document.write('希尔排序<br>');
        test('<br>未排序之前 '+randArray.join(" <wbr>"));
        shellSort(randArray);
        test('<br>排序之后 '+randArray.join(" <wbr>"));
//http://www.irt.org/script/341.htm
      }
    </script>

</head>
  <body>

</body>
</html>

排序过程如【动画模拟演示】。

posted on 2010-01-20 18:33 司徒正美阅读(813) 评论(0) 收藏举报

刷新页面返回顶部

Ruby's Louvre

导航

公告

希尔排序