选择排序 SelectionSort

public class SeletionSort {
	public static void main(String[] args) {
		int[] arr = { 3, 6, 9, 8, 7, 5, 4, 2, 1 };
		System.out.println("原始数组为:");
		print(arr);
		System.out.println("================");

		for (int j = 0; j < arr.length; j++) {
			int minPos = j;
			for (int i = j+1; i < arr.length; i++) {
				minPos = arr[i] < arr[minPos] ? i : minPos;
			}
			System.out.println("minPos is " + minPos);
			swap(arr, j, minPos);
			System.out.println("经过第"+(j+1)+"次交换后的数组:");
			print(arr);
		}
	}

	static void print(int[] arr) {
		for (int k : arr) {
			System.out.print(k + " ");
		}
		System.out.println();
	}

	static void swap(int[] arr, int i, int j) {
		int temp = arr[i];
		arr[i] = arr[j];
		arr[j] = temp;
	}
}