选择排序

// 续写选择排序，先用外围i作为从从下标零开始排列的数字，每扫描一次对比找到最小的值与下标i的值交换

public class Main {
	public static void main(String[] args) {
		int[] arr = {32, 25, 48, 12, 56, 17};
		for (int i = 0; i < arr.length - 1; i++) {
			int minIndex = i;
			for (int j = i + 1; j < arr.length; j++) {
				minIndex = arr[j] < arr[minIndex] ? j : minIndex;
			}
			swap(arr, i, minIndex);
		}
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i] + " ");
		}
	}
	public static void swap(int[] arr, int i, int j) {
		int tmp = arr[i];
		arr[i] = arr[j];
		arr[j] = tmp;
	}
}