排序算法之：选择排序

思想：每次选最小的放在第i位置。

package utils;

//选择排序
public class SeletSort {
	static final int SIZE = 10;

	static void selectS(int[] a) {
		int temp;
		for (int i = 0; i < a.length - 1; i++) {
			int index = i;
			for (int j = i + 1; j < a.length; j++) {
				if (a[j] < a[index]) {
					index = j;
				}
			}
			// 交换两个数
			if (index != i) {
				temp = a[i];
				a[i] = a[index];
				a[index] = temp;
			}

			System.out.print("第" + i + "结果:");
			for (int k = 0; k < a.length; k++) {
				System.out.print("   " + a[k]);

			}
			System.out.print("\n");
		}
	}

	public static void main(String[] args) {
		int[] shu = new int[SIZE];
		int i;
		for (i = 0; i < SIZE; i++) {
			shu[i] = (int) (100 + Math.random() * (100 + 1));
			System.out.print("  " + shu[i]);
		}
		System.out.print("\n");
		selectS(shu);

		System.out.print("over--");
	}

}