数据结构223-希尔排序的实现代码 

<!DOCTYPE html>
<html lang="en">
  <head>
    <meta charset="UTF-8" />
    <meta http-equiv="X-UA-Compatible" content="IE=edge" />
    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
    <title>ArrayList</title>
  </head>
  <body>
    <script>
      function ArrayList() {
        //属性
        this.array = [];
        //
        ArrayList.prototype.insert = function (item) {
          this.array.push(item);
        };

        ArrayList.prototype.toString = function (item) {
          return this.array.join("-");
        };
        ArrayList.prototype.swap = function (m, n) {
          var temp = this.array[m];
          this.array[m] = this.array[n];
          this.array[n] = temp;
        };

        ArrayList.prototype.shallSort = function () {
          var length = this.array.length;
          var gap=Math.floor(length/2);
          while(gap>=1){
            for(var i=gap;i<length;i++){
                var temp=this.array[i]
                var j=i
                while(this.array[j-gap]){
                    j-=gap
                }
            }
            this.array[j]=temp
          }
          gap=Math.floor(gap/2)
        }
      }
    </script>
  </body>
</html>

posted @ 2022-12-25 20:21  前端导师歌谣  阅读(20)  评论(0)    收藏  举报  来源