zoukankan      html  css  js  c++  java
  • 插入排序的实现

    插入排序过程数据演示:

        function CArray(numElements) {
            this.dataStore = [];
            this.numElements = numElements;
            this.prints = prints;
            this.setData = setData;
            //this.bubbleSort = bubbleSort;
            this.insertionSort = insertionSort;
        }
        function setData() {
            for ( var i = 0; i < this.numElements; ++i) {
                this.dataStore[i] = Math.floor(Math.random()
                        * (this.numElements + 1));
            }
        }
        function prints() {
            for ( var i = 0; i < this.dataStore.length; ++i) {
                document.write(this.dataStore[i] + " ");
                if (i > 0 & i % 10 == 0) {
                    document.write("<br />");
                }
            }
        }
    
        function insertionSort() {
            var temp, inner;
            for ( var outer = 1; outer < this.dataStore.length; ++outer) {
                temp = this.dataStore[outer];
                //选中一个值作为临时值,使得其前面的数依次与它进行比较
                inner = outer;
                while (inner > 0 && (this.dataStore[inner - 1] >= temp)) {
                    this.dataStore[inner] = this.dataStore[inner - 1];
                    --inner;
                }
                this.dataStore[inner] = temp;
            }
        }
        var numElements = 100;
        var myNums = new CArray(numElements);
        myNums.setData();
        myNums.insertionSort();
        myNums.prints();
  • 相关阅读:
    曾国藩谕纪泽纪鸿
    简单实现KeyChain实例
    UUID、UDID和KeyChain
    iOS沙盒目录结构解析 (转)
    BOOL布尔类型
    表达式
    赋值运算符
    变量
    常量
    GET请求和POST请求简单说明
  • 原文地址:https://www.cnblogs.com/feile/p/5397005.html
Copyright © 2011-2022 走看看