鸡尾酒排序

 
         var cocktailSort= function(array) {
          var top = array.length - 1, bottom = 0,flag = true,i, j;
          while (flag) {
            flag = false;
            //从左到右到大，把最大的放到每次范围的最右边
            for (i = bottom; i < top; i++) {
              if (array[i] > array[i + 1]) {
                swap(array, i, i + 1);
                flag = true;
              }
            }
            top--;
            //从右到到左，把最小的放到每次范围的最小边
            for (j = top; j > bottom; j--) {
              if (array[j] < array[j - 1]) {
                swap(array, j, j - 1);
                flag = true;
              }
            }
            bottom++;
          }
        }

        var swap = function(array,a,b){
          var tmp = array[a];
          array[a] = array[b]
          array[b] = tmp;
        }

<!doctype html>
<html dir="ltr" lang="zh-CN">
  <head>
    <meta charset="utf-8"/>
    <title>鸡尾酒排序 by 司徒正美</title>
 
    <script type="text/javascript" charset="utf-8">
      window.onload = function(){
        var assert ,item,test = function(str){
          if(!assert){
            assert = document.createElement("ol");
            assert.i = 0;
            item = document.createElement("li");
            document.body.insertBefore(assert,null);
          }
          var li = item.cloneNode(false);
          assert.appendChild(li);
          li.innerHTML = str;
          assert.i++;
          li.style.backgroundColor = assert.i%2 === 1? "#e6e6e6" : "#D0E4FC";
        };
 
          var cocktailSort= function(array) {
          var top = array.length - 1, bottom = 0,flag = true,i, j;
          while (flag) {
            flag = false;
            //从左到右到大，把最大的放到每次范围的最右边
            for (i = bottom; i < top; i++) {
              if (array[i] > array[i + 1]) {
                swap(array, i, i + 1);
                flag = true;
              }
            }
            top--;
            //从右到到左，把最小的放到每次范围的最小边
            for (j = top; j > bottom; j--) {
              if (array[j] < array[j - 1]) {
                swap(array, j, j - 1);
                flag = true;
              }
            }
            bottom++;
          }
        }

var swap = function(array,a,b){
          var tmp = array[a];
          array[a] = array[b]
          array[b] = tmp;
        }
 
        var randArray = [];
        for(i=0; i<100; i++)
          randArray[i]=Math.floor((Math.random())*10000);
 
        document.write('希尔排序<br>');
        test('<br>未排序之前 '+randArray.join(" <wbr>"));
        cocktailSort(randArray);
        test('<br>排序之后 '+randArray.join(" <wbr>"));

}
    </script>
 
 
  </head>
  <body>
   
 
  </body>
</html>

posted on 2010-01-20 18:34 司徒正美阅读(897) 评论(0) 编辑收藏举报

会员力量，点亮园子希望

刷新页面返回顶部

Ruby's Louvre

导航

公告

鸡尾酒排序