js选择排序算法

第一步

var p = [2, 4, 3, 1, 7, 5, 6, 9, 6, 0];

function sorrt(ary) {
    length = ary.length;
    for (var i = 0; i < length; i++) {
        _min = ary[i]
        k = i
        for (var j = i + 1; j < length; j++) {
            if (_min > ary[j]) {
                _min = ary[j]
                k = j
            }
        }
        ary[k] = ary[i]
        ary[i] = _min
    }
    return ary;
}
pp = sorrt(p)
alert(pp)

写成闭包

function order(arry){
	var ary=arry
	function sorrt() {
    length = ary.length;
    for (var i = 0; i < length; i++) {
        _min = ary[i]
        k = i
        for (var j = i + 1; j < length; j++) {
            if (_min > ary[j]) {
                _min = ary[j]
                k = j
            }
        }
        ary[k] = ary[i]
        ary[i] = _min
    }
    return ary;
}
	return {sor:sorrt};	
	}
	
var k=order([4,2,6,5,8,0,1,3,2])
alert(k.sor())