【算法】程序猿不写代码是不对的18

package com.kingdz.algorithm.time201702;

import java.util.Arrays;

/**
* 简单选择排序
*
* @author kingdz
*
*/
public class Algo16 {

public static void main(String[] args) {
int count = 10;
int[] number = new int[count];
number = Algo13.fillArray(count, false);
System.out.println(Arrays.toString(number));
selectSort(number);
}

private static void selectSort(int[] number) {
for (int i = 0; i < number.length; i++) {
int target = i;
for (int j = i + 1; j < number.length; j++) {
if (number[j] < number[target]) {
target = j;
}
}
Algo13.swap(number, i, target);
System.out.println(Arrays.toString(number));
}
}

}