JavaScript版几种常见排序算法

深碍√TFBOYSˉ_ 2022-06-15 02:59 313阅读 0赞

// ---------- 一些排序算法
    // js 利用sort进行排序
    systemSort: function(array) {
        return array.sort(function(a, b) {
            return a - b;
        });
    },
    // 冒泡排序
    bubbleSort: function(array) {
        var i = 0,
        len = array.length,
        j, d;
        for (; i < len; i++) {
            for (j = 0; j < len; j++) {
                if (array[i] < array[j]) {
                    d = array[j];
                    array[j] = array[i];
                    array[i] = d;
                }
            }
        }
        return array;
    },
    // 快速排序
    quickSort: function(array) {
        //var array = [8,4,6,2,7,9,3,5,74,5];
        //var array = [0,1,2,44,4,324,5,65,6,6,34,4,5,6,2,43,5,6,62,43,5,1,4,51,56,76,7,7,2,1,45,4,6,7];
        var i = 0;
        var j = array.length - 1;
        var Sort = function(i, j) {
    
            // 结束条件
            if (i == j) {
                return
            };
    
            var key = array[i];
            var stepi = i; // 记录开始位置
            var stepj = j; // 记录结束位置
            while (j > i) {
                // j <<-------------- 向前查找
                if (array[j] >= key) {
                    j--;
                } else {
                    array[i] = array[j]
                    //i++ ------------>>向后查找
                    while (j > ++i) {
                        if (array[i] > key) {
                            array[j] = array[i];
                            break;
                        }
                    }
                }
            }
    
            // 如果第一个取出的 key 是最小的数
            if (stepi == i) {
                Sort(++i, stepj);
                return;
            }
    
            // 最后一个空位留给 key
            array[i] = key;
    
            // 递归
            Sort(stepi, i);
            Sort(j, stepj);
        }
    
        Sort(i, j);
    
        return array;
    },
    
    // 插入排序
    insertSort: function(array) {
    
        // http://baike.baidu.com/image/d57e99942da24e5dd21b7080
        // http://baike.baidu.com/view/396887.htm
        //var array = [0,1,2,44,4,324,5,65,6,6,34,4,5,6,2,43,5,6,62,43,5,1,4,51,56,76,7,7,2,1,45,4,6,7];
        var i = 1,
        j, step, key, len = array.length;
    
        for (; i < len; i++) {
    
            step = j = i;
            key = array[j];
    
            while (--j > -1) {
                if (array[j] > key) {
                    array[j + 1] = array[j];
                } else {
                    break;
                }
            }
    
            array[j + 1] = key;
        }
    
        return array;
    },
    
    // 希尔排序
    //Jun.array.shellSort(Jun.array.df(10000));
    shellSort: function(array) {
    
        // http://zh.wikipedia.org/zh/%E5%B8%8C%E5%B0%94%E6%8E%92%E5%BA%8F
        // var array = [13,14,94,33,82,25,59,94,65,23,45,27,73,25,39,10];
        var stepArr = [1750, 701, 301, 132, 57, 23, 10, 4, 1]; // reverse() 在维基上看到这个最优的步长 较小数组
        //var stepArr = [1031612713, 217378076, 45806244, 9651787, 2034035, 428481, 90358, 19001, 4025, 836, 182, 34, 9, 1]//针对大数组的步长选择
        var i = 0;
        var stepArrLength = stepArr.length;
        var len = array.length;
        var len2 = parseInt(len / 2);
    
        for (; i < stepArrLength; i++) {
            if (stepArr[i] > len2) {
                continue;
            }
    
            stepSort(stepArr[i]);
        }
    
        // 排序一个步长
        function stepSort(step) {
    
            //console.log(step) 使用的步长统计
            var i = 0,
            j = 0,
            f, tem, key;
            var stepLen = len % step > 0 ? parseInt(len / step) + 1 : len / step;
    
            for (; i < step; i++) { // 依次循环列
                for (j = 1;
                /*j < stepLen && */
                step * j + i < len; j++) { //依次循环每列的每行
                    tem = f = step * j + i;
                    key = array[f];
    
                    while ((tem -= step) >= 0) { // 依次向上查找
                        if (array[tem] > key) {
                            array[tem + step] = array[tem];
                        } else {
                            break;
                        }
                    }
    
                    array[tem + step] = key;
    
                }
            }
    
        }
    
        return array;
    
    }

本文转载： [http://www.cnblogs.com/idche/archive/2011/02/16/1956397.html][http_www.cnblogs.com_idche_archive_2011_02_16_1956397.html]

[http_www.cnblogs.com_idche_archive_2011_02_16_1956397.html]: http://www.cnblogs.com/idche/archive/2011/02/16/1956397.html