js实现的选择排序算法

var selectionSort = function (arr) {
    var length = arr.length;
    var indexTemp;
    for (var i = 0; i <length-1; i++) {
        indexMin=i;
        for(var j=i;j<length;j++){
            if(arr[indexMin]>arr[j]){
                indexMin=j;
            }
        }
        if(i!=indexMin){
            swap(indexMin,i);
        }
    }

    function swap(index1, index2) {
        var temp = arr[index1];
        arr[index1] = arr[index2];
        arr[index2] = temp;
    }

    return arr;
}
var arr = [1, 6, 2, 5, 9, 2, 0,9];
console.log(arr.toString());
console.log(selectionSort(arr).toString());

猜你喜欢

转载自blog.csdn.net/mangxi8200/article/details/81130245