组合排序

        var combSort = function(array){
          var gap = array.length;
          do{
            gap = gap * 10 / 13
            if(gap === 9 || gap === 10)
              gap = 11
            if(gap < 1){
              gap = 1
            }
            var swapped = false;
            for(var i=0;i<array.length-gap;i++){
              var j = i + gap
              if(array[i]>array[j]){
                var temp = array[i];
                array[i] = array[j];
                array[j] = temp;
                test(array)
                swapped = true
              }
            }
            if(gap == 1 && !swapped){
              break;
            }
          }while(1);
        }

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

var a = [4,10,9,8,7,6]
        test("原数组   "+a)
        combSort(a);

}
    </script>

</head>
  <body>

</body>
</html>

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

刷新页面返回顶部

Ruby's Louvre

导航

公告

组合排序