选择排序Work07

选择排序

	public static void main(String[] args) {
		int[] nums = {10,9,88,12,7,76,34,57,109};
		for (int j = 0; j < nums.length; j++) {
			int tagIndex = j;
			int minIndes = j;
			for (int i = j; i < nums.length; i++) {
				if (nums[minIndes]>nums[i]) {
					minIndes = i;
				}
			}
			//标记值与最小值交换位置
			if (tagIndex != minIndes) {
				int x = nums[tagIndex];
				nums[tagIndex] = nums[minIndes];
				nums[minIndes] = x;
			}
		}
		//遍历输出
		for (int i : nums) {
			System.out.print(i+",");
		}
		}
	}