JavaScript实现多种排序算法详解：冒泡、插入、快速与希尔

・  冒泡排序：最简单，也最慢，貌似长度小于7最优

・  插入排序： 比冒泡快，比快速排序和希尔排序慢，较小数据有优势

・  快速排序：这是一个非常快的排序方式，V8的sort方法就使用快速排序和插入排序的结合

・  希尔排序：在非chrome下数组长度小于1000，希尔排序比快速更快

・  系统方法：在forfox下系统的这个方法非常快
 

 // ---------- 一些排序算法  
    // 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 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){