计数排序

        var countSort = function(array) {
          var i, z = 0, count = [],
          min = Math.min.apply({}, array),
          max = Math.max.apply({}, array),
          size = array.length;
          //给新数组预填为零
          for (i = min; i <= max; i++) {
            count[i] = 0;
          }
          for (i=0; i < size; i++) {
            count[array[i]]++;
          }

          for (i = min; i <= max; i++) {
            while (count[i]-- > 0) {//循环新数组，如果不为零，则把i返回array
              array[z++] = i;
            }
          }
          return array;
        }

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

for (i = min; i <= max; i++) {
            while (count[i]-- > 0) {//循环新数组，如果不为零，则把i返回array
              array[z++] = i;
            }
          }
          return array;
        }

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

document.write('<br>计数排序:<BR>');
        test('<br>未排序之前 '+randArray.join(" <wbr>"));
        countSort(randArray);
        test('<br>排序之后 '+randArray.join(" <wbr>"));
      }
    </script>

</head>
  <body>

</body>
</html>

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

刷新页面返回顶部

Ruby's Louvre

导航

公告

计数排序