【www.gdgbn.com--js教程】

下面来看看网页特效中常用的一些排序方法 ，我们主要是包括有冒泡 插入 希尔排序方法 ，主要是针对数组操作。

    // ---------- 一些排序算法
   

// 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             for(j=0; 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 tempi = i; // 记录开始位置
            var tempj = 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(tempi == i){
                sort(++i, tempj);
                return ;
            }
           
            // 最后一个空位留给 key
            array[i] = key;
           
            // 递归
            sort(tempi, i);
            sort(j, tempj);
        }
       
        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, temp, key,
            len = array.length;
       
        for(; i < len; i++){
           
            temp = 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 temparr = [1750, 701, 301, 132, 57, 23, 10, 4, 1]; // reverse() 在维基上看到这个最优的步长 较小数组
        //var temparr = [1031612713, 217378076, 45806244, 9651787, 2034035, 428481, 90358, 19001, 4025, 836, 182, 34, 9, 1]//针对大数组的步长选择
        var i = 0;
        var temparrlength = temparr.length;
        var len = array.length;
        var len2 =  parseint(len/2);
       
        for(;i < temparrlength; i++){
            if(temparr[i] > len2){
                continue;
            }
           
            temps教程ort(temparr[i]);
        }

        // 排序一个步长
        function tempsort(temp){
           
            //console.log(temp) 使用的步长统计
           
            var i = 0, j = 0, f, tem, key;
            var templen = len%temp > 0 ?  parseint(len/temp) + 1 : len/temp;
           
           
            for(;i < temp; i++){// 依次循环列

                for(j=1;/*j < templen && */temp * j + i < len; j++){//依次循环每列的每行
                    tem = f = temp * j + i;
                    key = array[f];

                    while((tem-=temp) >= 0){// 依次向上查找
                        if(array[tem] > key){
                            array[tem+temp] = array[tem];
                        }else{
                            break;
                        }
                    }
                   
                    array[tem + temp ] = key;
                   
                }
            }
           
        }
       
        return array;
       
    }

本文来源：http://www.gdgbn.com/wangyezhizuo/29147/