原理
1 外层循环 递增索引值 初始化第一个 比较的值
2 内层循环每次取的第一个比较值 随外层 i 值 递增, 避免重复对比之前的值
3 比较出更小的值, 赋值记录索引, 进行元素的位置调换
var arr = [ 0, 0, 1, 2, 3, 4, 5, 6, 12, 22, 123, 333, 333, 444, 555, 666, 777, 888, 999];
function selectionSotr(arr) {
var n = arr.length;
var countAll = 0;
var swapAll = 0;
for(let i=0; i < n; i++){
var tmp = arr[i];
var index = false;
for(let v = i; v < n; v++){
if(tmp < arr[v]){
tmp = arr[v];
index = v;
}
countAll += 1;
}
if(index){
[arr[i], arr[index]] = [arr[index], arr[i]];
swapAll += 1;
}
}
console.log('forLoop :' + countAll);
console.log('swap :' + swapAll);
return arr;
}
console.log(selectionSotr(arr));
forLoop :190
swap :10
[ 999, 888, 777, 666, 555, 444, 333, 333, 123, 22, 12, 6, 5, 4, 3, 2, 1, 0, 0 ]