鐃緒申鐃塾醐申離屮薀�鐃緒申鐃緒申鐃塾進駕申鐃緒申鐃緒申鐃殉わ申鐃緒申鐃塾で￥申鐃緒申鐃緒申謄戰鐃緒申鐃殉￥申鐃緒申鐃夙ってみわ申鐃緒申奮鐃緒申併鐃緒申造鐃緒申鐃�

404 Blog Not Found:javascript - Array#sort鐃緒申鐃緒申鐃緒申quicksort鐃緒申鐃緒申戮鐃�!?
Firefox 2鐃祝関わ申鐃銃はほわ申同鐃緒申鐃緒申鐃緒申鐃緒申Mac IE 5, Safari 2.0.4, Opera 9.02鐃叔わ申builtin鐃緒申鐃緒申鐃緒申速鐃緒申鐃獣わ申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃塾削申鐃熟最わ申鐃順き鐃緒申鐃獣わ申Safari鐃叔わ申3鐃緒申鐃緒申鐃駿で￥申builtin鐃夙わ申鐃銃はわ申呂鐃緒申戮鐃緒申茲�鐃祝醐申鐃緒申鐃暑。

鐃緒申鐃曙、10鐃緒申鐃緒申鐃叔わ申array鐃緒申10鐃藷ソ￥申鐃夙わ申鐃緒申鐃緒申鐃緒申Chrome鐃塾件申漫鐃�

builtin:        2389ms
quick_iter:     1827ms
quick_recur:    1848ms
merge_iter:     2316ms
merge_recur:    7058ms
benchmark-on-iphone

多鐃緒申鐃塾ドワ申侫箸呂鐃緒申鐃塾わ申鐃緒申鐃宿￥申鐃俊ワ申肇鐃緒申鐃緒申鐃銃居申鐃叔わ申鐃緒申鐃叔はなわ申鐃銃居申鐃叔のワ申鐃緒申鐃獣ワ申鐃緒申鐃緒申鐃夙わ申鐃緒申有鐃春わ申鐃駿わ申鐃淑る。鐃緒申鐃叔随申鐃緒申鐃順き鐃緒申鐃緒申鐃緒申腓�鐃緒申鐃循どわ申鐃塾件申鐃緒申鐃緒申鐃緒申鐃殉わ申澆鐃緒申鐃緒申鐃�

鐃緒申鐃淑みに￥申他鐃塾ブラウ鐃緒申鐃緒申鐃叔は￥申IE 7, Safari 3.2.1, Firefox 3.0.6, Opera 9.63 鐃塾わ申鐃緒申鐃緒申鐃俊ワ申肇鐃緒申鵑�逸申鐃緒申速鐃緒申鐃獣わ申鐃緒申

鐃緒申鐃淑みわ申 Safari 4 鐃塾件申漫鐃緒申鐃緒申鐃重�鐃祝削申速鐃緒申

builtin:         350ms
quick_iter:      885ms
quick_recur:    1246ms
merge_iter:     1505ms
merge_recur:    5449ms

鐃淑駕申鐃緒申鐃緒申分鐃叔ベワ申鐃緒申鐃緒申沺鐃緒申鐃緒申鐃緒申鐃緒申茲�鐃祝わ申鐃銃わ申鐃緒申鐃殉わ申鐃緒申鐃緒申鐃殉わ申鐃順き鐃淑随申鐃緒申鐃緒申鐃緒申鐃緒申鐃夙￥申鐃瞬ラウ鐃緒申鐃緒申鐃塾ワ申鐃緒申鐃宿ルタ鐃緒申鐃殉￥申鐃緒申鐃旬わ申鐃緒申鐃叔緒申鐃緒申鐃緒申鐃緒申鐃塾で￥申鐃緒申鐃緒申鐃熟どわ申鐃緒申眈�鐃緒申鐃緒申砲鐃緒申討鐃緒申鐃殉わ申鐃緒申100000 * 10鐃夙わ申鐃熟￥申Safari 4鐃緒申Chrome鐃淑鰹申鐃熟わ申鐃銃わ申鐃緒申鐃緒申鐃緒申鐃緒申鐃処い鐃叔わ申鐃順う鐃緒申

鐃宿居申:鐃緒申鐃淑みわ申iPhone鐃叔もこ鐃緒申鐃縮わ申動鐃緒申鐃殉わ申鐃緒申鐃緒申鐃駿わ申鐃塾わ申動鐃緒申鐃淑わ申鐃緒申鐃夙思っわ申鐃緒申鐃獣ぱわ申鐃緒申鐃緒申鐃銃逸申鐃緒申鐃緒申箸鐃緒申鐃緒申鐃�

Dan the JavaScripter

# of Items: # of Repeats: 





鐃緒申鐃縮の関随申


middle = function(h, t){ 
    return h + ((t - h) >>> 1)
};
cmp_number = function(a, b){
    return a - b;
}



鐃緒申鐃緒申鐃夙の種申鐃緒申鐃叔よく鐃術わ申鐃緒申鐃緒申愎鐃緒申任鐃緒申鐃�


鐃俊ワ申肇鐃緒申鐃�


builtinsort = function(ary, cmp){
    return ary.slice().sort(cmp || cmp_number);
};



鐃銃居申鐃叔ワ申鐃緒申鐃獣ワ申鐃緒申鐃緒申鐃緒申


quicksort_r = function(ary, cmp){
    var ret = ary.slice();
    if (! cmp ) cmp = cmp_number;
    return (function q(head, tail) {
        var pivot = ret[middle(head, tail)];
        var i = head - 1;
        var j = tail + 1;
        while (1){
            while (cmp(ret[++i], pivot) < 0);
            while (cmp(ret[--j], pivot) > 0);
            if (i >= j) break;
            var tmp = ret[i]; ret[i] = ret[j]; ret[j] = tmp;
        }
        if (head < i - 1) arguments.callee(head, i - 1);
        if (j + 1 < tail) arguments.callee(j + 1, tail);
        return ret;
    })(0, ary.length - 1);
}



鐃緒申撞鐃緒申妊鐃緒申鐃緒申奪鐃緒申鐃緒申鐃緒申鐃�


quicksort_i = function(ary, cmp){
    var ret = ary.slice();
    if (! cmp ) cmp = cmp_number;
    var stack = [ 0, ary.length - 1 ];
    while(stack.length){
        var tail = stack.pop();
        var head = stack.pop();
        var pivot = ret[middle(head, tail)];
        var i = head - 1;
        var j = tail + 1;
        while (1){
            while (cmp(ret[++i], pivot) < 0);
            while (cmp(ret[--j], pivot) > 0);
            if (i >= j) break;
            var tmp = ret[i]; ret[i] = ret[j]; ret[j] = tmp;
        }
        if (head < i - 1) { stack.push(head); stack.push(i - 1); }
        if (j + 1 < tail) { stack.push(j + 1); stack.push(tail); }
    }
    return ret;
}




鐃銃居申鐃叔マ￥申鐃緒申鐃緒申鐃緒申鐃緒申


(function(){

var merge = function(a, b, cmp){
    if (! cmp ) cmp = cmp_number;
    var i = 0, j = 0, k = 0;
    var li = a.length, lj = b.length;
    var ret = [];
    while(i < li && j < lj){
        ret[ret.length] = cmp(a[i],b[j]) <= 0 ? a[i++] : b[j++];
    }
    while(i < li) ret[ret.length] = a[i++];
    while(j < lj) ret[ret.length] = b[j++];
    return ret;
}

mergesort_r = function(ary, cmp){
    if (! cmp ) cmp = cmp_number;
    return (function(a){
        if (a.length <= 1) return a;
        var mid  = middle(0, a.length-1);
        var head = a.slice(0, mid+1); 
        var tail = a.slice(mid+1, a.length);
        return merge(arguments.callee(head), arguments.callee(tail), cmp)
    })(ary);
};

})();



鐃緒申撞鐃緒申妊沺鐃緒申鐃緒申鐃緒申鐃緒申鐃�


(function(){

var work = [];
var merge_inplace = function(ary, head, mid, tail, cmp){
    if (! cmp ) cmp = cmp_number;
    var h = tail - head + 1;
    for (var i = head, j = 0; i <= tail; i++, j++) work[j] = ary[i];
    if (mid > tail) mid = middle(head, tail);
    var t = mid - head + 1;
    for (var i = head, j = 0, k = t; i <= tail; i++){
        ary[i] = 
            j < t && (k == h || cmp(work[j], work[k]) <= 0) ?
            work[j++] : work[k++];
    }
};

mergesort_i = function(ary, cmp){
    if (! cmp ) cmp = cmp_number;
    var ret = ary.slice();
    var l   = ret.length;
    var lt2 = l * 2;
    var lm1 = l - 1;
    work.length = l;
    for (var s = 2; s < lt2; s *= 2){
        for (var head = 0; head < l; head += s){
            var tail = head + s - 1;
            merge_inplace(ret, 
                          head, 
                          middle(head, tail), 
                          tail < l ? tail : l-1, 
                          cmp);
        }
    }
    return ret;
};

})();