侏儒排序 - 爱码网

 
    var gnomeSort =function(array){
      var len = array.length,i = 0;//把i想象为侏儒
      while(i < len){
        if (i == 0 || array[i-1] <= array[i])
        //array[i-1]与array[i]想象为花盆
        //侏儒站于array[i]的前面
          i++;//由于顺序正确，侏儒就转而站在array[i+1]的前面
        else{
          swap(array,i, --i);//如果顺序不正确，交换花盘，站在array[i-1]的前面
          test(array)
        }
      }
    }
    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 gnomeSort =function(array){
      var len = array.length,i = 0;//把i想象为侏儒
      while(i < len){
        if (i == 0 || array[i-1] <= array[i])
        //array[i-1]与array[i]想象为花盆
        //侏儒站于array[i]的前面
          i++;//由于顺序正确，侏儒就转而站在array[i+1]的前面
        else{
          swap(array,i, --i);//如果顺序不正确，交换花盘，站在array[i-1]的前面
          test(array)
        }
      }
    }
    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>
</wbr></wbr>